Average-case quantum query complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 133-144

  Ambainis, Andris ^a   de Wolf, Ronald ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CWI   (Netherlands)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AVERAGE-CASE COMPLEXITY; NON-UNIFORM DISTRIBUTION; QUANTUM ALGORITHMS; QUANTUM COMPLEXITY; QUANTUM QUERY COMPLEXITY; SUPER-EXPONENTIAL; UNIFORM DISTRIBUTION; WORST-CASE COMPLEXITY;

QUANTUM THEORY;

EID: 84944032401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_11     Document Type: Conference Paper

References (20)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience, 1992.
2. L. Alonso, E. M. Reingold, and R. Schott. The average-case complexity of deter- mining the majority. SIAM Journal on Computing, 26(1):1-14, 1997.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In Proceedings of 39th FOCS, pages 352-361, 1998. http://xxx.lanl.gov/abs/quant-ph/9802049.
4. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510-1523, 1997. quant-ph/9701001.
5. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4-5):493-505, 1998. Earlier version in Physcomp'96. quant-ph/9605034.
6. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. Forthcoming.
7. G. Brassard, P. Høyer, and A. Tapp. Quantum algorithm for the collision problem. ACM SIGACT News (Cryptology Column), 28:14-19, 1997. quant-ph/9705002.
8. G. Brassard, P. Høyer, and A. Tapp. Quantum counting. In Proceedings of 25th ICALP, volume 1443 of Lecture Notes in Computer Science, pages 820-831. Springer, 1998. quant-ph/9805082.
9. D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. In Proceedings of the Royal Society of London, volume A439, pages 553-558, 1992.
10. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. A limit on the speed of quantum computation in determining parity. quant-ph/9802045, 16 Feb 1998.
11. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th STOC, pages 212-219, 1996. quant-ph/9605043.
12. E. Hemaspaandra, L. A. Hemaspaandra, and M. Zimand. Almost-everywhere superiority for quantum polynomial time. quant-ph/9910033, 8 Oct 1999.
13. L. A. Levin. Average case complete problems. SIAM Journal on Computing, 15(1):285-286, 1986. Earlier version in STOC'84.
14. M. Mosca. Quantum searching, counting and amplitude amplification by eigenvector analysis. In MFCS'98 workshop on Randomized Algorithms, 1998.
15. A. Nayak and F. Wu. The quantum query complexity of approximating the median and related statistics. In Proceedings of 31th STOC, pages 384-393, 1999. quantph/9804066.
16. N. Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20(6):999-1007, 1991. Earlier version in STOC'89.
17. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997. Earlier version in FOCS'94. quant-ph/9508027.
18. D. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5):1474-1483, 1997. Earlier version in FOCS'94.
19. J. S. Vitter and Ph. Flajolet. Average-case analysis of algorithms and data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, pages 431-524. MIT Press, Cambridge, MA, 1990.
20. Ch. Zalka. Grover's quantum searching algorithm is optimal. Physical Review A, 60:2746-2751, 1999. quant-ph/9711070.