The query complexity of order-finding

Information and Computation

Volumn 192, Issue 2, 2004, Pages 162-171

  Cleve, Richard ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

ARBITRARY PERMUTATIONS; ORDER FINDING; QUERIES SUFFICES; QUERY COMPLEXITY;

QUERY LANGUAGES;

EID: 3042653512     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.04.001     Document Type: Article

References (12)

1. Bach E., Shallit J. Algorithmic Number Theory. vol. 1:1996;MIT Press.
2. Baker R.C., Harman G. The difference between consecutive primes. Proc. London Math. Soc. 3:1996;261-280.
3. Bernstein E., Vazirani U.V. Quantum complexity theory. SIAM J. Comput. 26:1997;1411-1473.
4. Cleve R., Ekert A., Macchiavello C., Mosca M. Quantum algorithms revisited. Proc. R. Soc. London A. 454:1998;339-354.
5. L.K. Grover, A fast quantum mechanical algorithm for database search, in: Proceedings STOC 1996, Philadelphia PA, 1996, pp. 212-219.
6. Iwaniec H., Jutila M. Primes in short intervals. Arkiv för Matematik. 17:1979;167-176.
7. A.Y. Kitaev, Quantum measurements and the Abelian stabilizer problem, Unpublished print on ArXiv quant-ph/9511026, 1995.
8. Montgomery H.L. Zeroes of. L -functions Invent. Math. 8:1969;346-354.
9. M.A. Nielsen, I.L. Chuang, Quantum computation and quantum information, Cambridge, 2000.
10. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1997;1484-1509.
11. Simon D. On the power of quantum computation. SIAM J. Comput. 26:1997;1474-1483.
12. A.C. Yao, Lower bounds by probabilistic arguments, in: Proceedings FOCS 1983, Tucson, AZ, 1983, pp. 420-428.