An efficient quantum algorithm for the Moebius function

preprint2016arXivOpen access

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 $\log n$ and does not require the computation of the prime factorization of $n$ as an intermediate step.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

An efficient quantum algorithm for the Moebius function

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0