Quantum lower bounds by quantum arguments

Journal of Computer and System Sciences

Volumn 64, Issue 4, 2002, Pages 750-767

  Ambainis, Andris ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Quantum computing; Quantum lower bounds; Quantum query algorithms

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

GROVER'S ALGORITHM; QUANTUM COMPUTING; QUANTUM LOWER BOUNDS; QUANTUM THEORY ALGORITHMS;

QUANTUM THEORY;

EID: 0042418642     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1826     Document Type: Conference Paper

References (27)

1. 2 quant-ph/9902053.
2. A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson, Quantum communication of complexity of sampling, in "Proceedings of FOCS'98," pp. 342-351, 1998.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, in "Proceedings of FOCS'98," pp. 352-361, 1998. Also quant-ph/9802049.
4. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26 (1997), 1510-1523, quant-ph/9701001.
5. S. Bose, L. Rallan, and V. Vedral, Communication capacity of quantum information, Phys. Rev. Lett. 85 (2000), 5448-5451. Also quant-ph/0003072.
6. G. Brassard, P. Høyer, and A. Tapp, Quantum algorithm for the collision problem, ACM SIOACT News (Cryptology Column) 28 (1997), 14-19, quant-ph/9705002.
7. H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka, Bounds for small-error and zero-error quantum algorithms, in "Proceedings of FOCS'99," pp. 358-368, 1999. Also cs.CC/9904019.
8. H. Buhrman, R. Cleve, and A. Wigderson, Quantum vs. classical communication and computation, in "Proceedings of STOC'98," pp. 63-68, 1998. Also quant-ph/9802046.
9. H. Buhrman, C. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, and R. de Wolf, Quantum algorithms for element distinctness, in "Proceedings of CCC'01," pp. 131-137. Also quant-ph/ 0007061.
10. H. Buhrman and R. de Wolf, Communication complexity lower bounds by polynomials, in "Proceedings of CCC'01," pp. 120-130. Also cs.CC/9910010.
11. E. Farhi and S. Gutmann, An analog analogue of a digital quantum computation, Phys. Rev. A 57 (1996), 2403-2406, quant-ph/9612026.
12. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, A limit on the speed of quantum computation in determining parity, Phys Rev. Lett. 81 (1998), 5442-5444, quant-ph/9802045.
13. L. Grover, A fast quantum mechanical algorithm for database search, in "Proceedings of the 28th ACM Symposium on Theory of Computing," pp. 212-219, 1996, quant-ph/9605043.
14. L. Grover, How fast can a quantum computer search? quant-ph/9809029.
15. P. Hoyer, J. Neerbek, and Y. Shi, Quantum bounds for ordered searching and sorting, and element distinctness, in "Proceedings of ICALP'01," Lecture Notes in Computer Science, Vol. 2076, pp. 346-357, 2001. Also quant-ph/0102078.
16. A. Yu Kitaev, Quantum measurements and the Abelian stabilizer problem, quant-ph/9511026.
17. B. Kalyanasundaram and G. Schnitger, The probabilistic communication complexity of set intersection, SIAM J. Discrete Mathematics 5 (1992), 545-557.
18. Also Structures'87.
19. A. Nayak and F. Wu, The quantum query complexity of approximating the median and related statistics, in "Proceedings of STOC'99," pp. 343-393. Also quant-ph/98104066.
20. N. Nissan, CREW PRAM and decision trees, SIAM J. Comput. 20 (1991), 999-1007.
21. Also STOC'89.
22. A. Razborov, On the distributional complexity of disjointness, Theoret. Comput. Sci. 106 (1992), 385-390.
23. Also ICALP'90.
24. Y. Shi, Lower bounds of quantum black-box complexity and degree of approximation polynomials by influence of Boolean variables, Inform. Process. Lett. 75 (2000), 79-83. Also quant-ph/9904107.
25. P. Shor, Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997), 1484-1509.
26. Also FOCS'94.
27. U. Vazirani, On the power of quantum computation, Philos. Trans. Roy. Soc. London, Ser. A: Math. Phys. Sci. 356 (1998), 1759-1768.