Tight bounds on quantum searching

Fortschritte der Physik

Volumn 46, Issue 4-5, 1998, Pages 493-505

  Boyer, Michel ^a   Brassard, Gilles ^a   HØyer, Peter ^b   Tapp, Alain ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Lower bound; Quantum computation; Searching

Indexed keywords

EID: 0032338939     PISSN: 00158208     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P     Document Type: Article

References (11)

1. BARENCO, A., C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. A. SMOLIN and H. WEINFURTER, "Elementary gates for quantum computation", Physical Review A, Vol. 52, 1995, pp. 3457-3467.
2. BENNETT, C. H., E. BERNSTEIN, G. BRASSARD and U. VAZIRANI, "Strengths and weaknesses of quantum computing", SIAM Journal on Computing, Vol. 26, no. 5, October 1997, pp. 1510-1523.
3. BRASSARD, G., "Searching a quantum phone book", Science, Vol. 275, 31 January 1997, pp. 627-628.
4. BRASSARD, G., P. HØYER and A. TAPP, ØQuantum cryptanalysis of hash and claw-free functions", Proceedings of Third Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science, Vol. 1380, Springer Verlag 1998.
5. DEUTSCH, D. and R. JOZSA, "Rapid solution of problems by quantum computation", Proceedings of the Royal Society, London, Vol. A439, 1992, pp. 553-558.
6. GAREY, M. R. and D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, 1979.
7. GROVER, L. K., "A fast quantum mechanical algorithm for database search", Proceedings of 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 212-219.
8. GROVER, L. K., "Quantum mechanics helps in searching for a needle in a haystack", Physical Review Letters, Vol. 79, no. 2, 14 July 1997, pp. 325-328.
9. KITAEV, A. YU., "Quantum measurements and the Abelian stabilizer problem", manuscript, 1995. Available on Los Alamos e-Print archive (http://xxx.lanl.gov) as quant-ph/9511026.
10. NATIONAL BUREAU OF STANDARDS, "Data Encryption Standard", Federal Information Processing Standard, U.S. Department of Commerce, FIPS PUB 46, Washington, DC, 1977.
11. SHOR, P. W., "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer", SIAM Journal on Computing, Vol. 26, no. 5, October 1997, pp. 1484-1509.