An efficient quantum algorithm for the Moebius function
Abstract
We give an efficient quantum algorithm for the Moebius function μ(n) from the natural numbers to \-1,0,1\. The cost of the algorithm is asymptotically quadratic in n and does not require the computation of the prime factorization of n as an intermediate step.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.