Quantum Probabilistic Subroutines and Problems in Number Theory
We describe a quantum version of the classical probabilistic algorithms à la Rabin. The quantum probabilistic algorithm is fully unitary and reversible, and can be used as a subroutine in larger quantum computations. As an example, we describe a polynomial time algorithm for counting the number of primes smaller than a given integer.
KeywordsQuantum algorithms number theory
Unable to display preview. Download preview PDF.
- L.K. Grover, in Proceedings of the 28th Annual Symposium on the Theory of Computing (ACM Press, New York, 1996), p. 212.Google Scholar
- G. Brassard, P. Hoyer and A. Tapp, Los Alamos e-print quant-ph/9805082; M. Boyer, G. Brassard, P. Hoyer and A. Tapp, in Proceedings of the 4th Workshop on Physics and Computation (ed. T. Toffoli et al., New England Complex Systems Institute, Boston, 1996), p. 36.Google Scholar