Sharp quantum versus classical query complexity separations

Algorithmica (New York)

Volumn 34, Issue 4, 2002, Pages 449-461

  De Beaudrap, J Niel ^a   Cleve, Richard ^a   Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Quantum algorithms; Quantum Fourier transform

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; ERROR ANALYSIS; FOURIER TRANSFORMS; POLYNOMIALS;

QUANTUM ALGORITHMS;

QUANTUM THEORY;

EID: 0037709219     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0978-1     Document Type: Article

References (19)

1. A. Barenco, C. H. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter, Elementary gates for quantum computation. Physical Review A, 52:3457-3467, 1995.
2. J. N de Beaudrap, R. Cleve, and J. Watrous, Quantum Fourier transforms for extracting hidden linear structures in finite fields. Los Alamos Preprint Archive quant-ph/0011065, 2000.
3. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997.
4. D. Boneh and R. Lipton. Quantum cryptanalysis of hidden linear functions. In Advances in Cryptology - Crypto '95, volume 963 of Lecture Notes in Computer Science, pages 242-437. Springer-Verlag, Berlin, 1995.
5. G. Brassard and P. Hoyer. An exact quantum polynomial-time algorithm for Simon's problem. In Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pages 12-23, 1997.
6. R. Cleve. The query complexity of order-finding. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 54-59, 2000.
7. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca. Quantum algorithms revisited. Proceedings of the Royal Society, London, Series A, 454:339-354, 1998.
8. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, New York, 1993.
9. W. van Dam and S. Hallgren. Efficient quantum algorithms for shifted quadratic character problems. Los Alamos Preprint Archive quant-ph/0011067, 2000.
10. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society, London, Series A, 400:97-117, 1985.
11. D. Deutsch and R. Jozsa. Rapid solutions of problems by quantum computation. Proceedings of the Royal Society, London, Series A, 439:553-558, 1992.
12. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, Cambridge, 1999.
13. L. Hales and S. Hallgren. An improved quantum Fourier transform algorithm and applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 515-525, 2000.
14. S. Hallgren. Personal communication, 2001.
15. R. Lidl and H. Niederreiter. Introduction to Finite Fields and Their Applications, revised edition. Cambridge University Press, Cambridge, 1994.
16. M. Mosca and A. Ekert. The hidden subgroup problem and eigenvalue estimation on a quantum computer. In Proceedings of the 1st NASA International Conference on Quantum Computing and Quantum Communication, volume 1509 of Lecture Notes in Computer Science, pages 174-188. Springer-Verlag, Berlin, 1999. Also available from the Los Alamos Preprint Archive quant-ph/9903071.
17. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
18. D. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5):1474-1483, 1997.
19. A. C.-C. Yao. Lower bounds by probabilistic arguments. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 420-428, 1983.