Quantum search on bounded-error inputs

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

Volumn 2719, Issue , 2003, Pages 291-299

  Høyer, Peter ^a   Mosca, Michele ^b   De Wolf, Ronald ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AMPLIFICATION; ERRORS; PROBABILITY; QUANTUM THEORY;

BOUNDED ERROR PROBABILITY; BOUNDED ERRORS; ERROR PROBABILITIES; ERROR REDUCTION; HIGH PROBABILITY; QUANTUM ALGORITHMS; QUANTUM AMPLITUDE AMPLIFICATION; QUANTUM SEARCH;

ALGORITHMS;

EID: 35248867320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_25     Document Type: Article

References (13)

1. A. Ambainis. Quantum lower bounds by quantum arguments. In Proceedings of 32nd ACM STOC, pages 636-643, 2000.
2. H. Barnum and M. Saks. A lower bound on the quantum query complexity of read-once functions, quant-ph/0201007, 3 Jan 2002.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In Proceedings of 39th IEEE FOCS, pages 352-361, 1998.
4. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510-1523, 1997.
5. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411-1473, 1997.
6. G. Brassard and P. Høyer. An exact quantum polynomial-time algorithm for Simon's problem. In Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS'97), pages 12-23, 1997.
7. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4-5):493-505, 1998.
8. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Lomonaco, S. J., Jr. and Brandt, H.E. (eds.): Quantum Computation and Quantum Information: A Millennium Volume. AMS Contemporary Mathematics Series, 305:53-74, 2002.
9. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of 30th ACM STOC, pages 63-68, 1998.
10. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th ACM STOC, pages 212-219, 1996.
11. P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality. In Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2002), Lecture Notes in Computer Science, Vol. 2285, pages 299-310. Springer-Verlag, 2002.
12. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
13. Y. Shi. Approximating linear restrictions of Boolean functions. Unpublished manuscript, 2002.