Generalized grover search algorithm for arbitrary initial amplitude distribution

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

Volumn 1509, Issue , 1999, Pages 140-147

  Biron, David ^a   Biham, Ofer ^a   Biham, Eli ^b   Grassl, Markus ^c   Lidar, Daniel A ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF KARLSRUHE   (Germany)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Exact solution; Grover s algorithm; Quantum searching

Indexed keywords

DIFFERENCE EQUATIONS; NASA; PROBABILITY DISTRIBUTIONS; QUANTUM COMPUTERS;

AMPLITUDE DISTRIBUTIONS; EXACT SOLUTION; GROVER SEARCH ALGORITHM; LINEAR DIFFERENCE EQUATIONS; OPTIMAL MEASUREMENTS; QUANTUM SEARCHING; S-ALGORITHMS; STANDARD DEVIATION;

QUANTUM COMMUNICATION;

EID: 84904569271     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49208-9_10     Document Type: Conference Paper

References (12)

1. P.W. Shor, Polynomial-time algorithms for prime factorization and discrete loga- rithms on a quantum computer, SIAM Journal on Computing, 26, 1484 (1997).
2. L. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth Annual Symposium on the Theory of Computing, ACM Press (New York, 1996), p. 212.
3. L. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325 (1997).
4. C.H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weak- nesses of quantum computing, SIAM Journal on Computing 26, 1510 (1997).
5. C. Zalka, Grover’s quantum searching algorithm is optimal (LANL preprint quant-ph/9711070).
6. L. Grover, Quantum telecomputation (LANL preprint quant-ph/9704012).
7. C. Durr and P. Hoyer, A quantum algorithm for finding the minimum (LANL preprint quant-ph/9607014).
8. G. Brassard, P. Hoyer, and A. Tapp, Quantum algorithm for the collision problem (LANL preprint quant-ph/9705002).
9. L. Grover, Quantum computers can search arbitrarily large databases by a single query, Phys. Rev. Lett. 79, 4709 (1997).
10. B.M. Terhal and J.A. Smolin, Single quantum querying of a database (LANL preprint quant-ph/9705041).
11. M. Boyer, G. Brassard, P. Hoyer and A. Tapp, Tight bounds on quantum searching, in Proceedings of the fourth workshop on Physics and Computation, edited by T. Toffoli, M. Biafore and J. Leao, New England Complex Systems Institute, (Boston, 1996), p. 36. To appear in Fortschritte der Physik.
12. D. Biron, O. Biham, E. Biham, M. Grassl, and D.A. Lidar, to be published.