Search via quantum walk

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 575-584

  Magniez, Frederic ^a   Nayak, Ashwin ^b   Roland, Jeremie ^c   Santha, Miklos ^a  

^a Université Paris Saclay   (France)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Amplitude amplification; Hitting time; Markov chain; Phase estimation; Phase gap; Quantum walk; Recursive amplitude amplification; Reflection operator; Search; Spectral gap

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FINITE ELEMENT METHOD; MARKOV PROCESSES; SEARCH ENGINES;

AMPLITUDE AMPLIFICATION; PHASE ESTIMATION; PHASE GAP; QUANTUM WALK;

QUANTUM THEORY;

EID: 35548965589     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250874     Document Type: Conference Paper

References (27)

1. S. Aaronson and Y. Shi. Quantum lower bound for the collision and the element distinctness problems. Journal of the ACM, pages 595-605, 2004.
2. S. Aaronson and A. Ambainis. Quantum search of spatial regions. Theory of Computing, 1:47-79, 2005.
3. D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. In Proceedings of the 33rd ACM Symposium on Theory of computing, pages 50-59, 2001.
4. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. http://www.stat.berkeley.edu/~aldous/RWG/book.html. Monograph in preparation, August 2006 version.
5. A. Ambainis, J. Kempe, and A. Rivosh. Coins make quantum walks faster. In Proceedings of the 16th ACM-SIAM symposium on Discrete algorithms, pages 1099-1108, 2005.
6. A. Ambainis. Quantum Walk Algorithm for Element Distinctness. In Proceedings of the 45th Symposium on Foundations of Computer Science, pages 22-31, 2004.
7. A. Ambanis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the 33rd ACM Symposium on Theory of computing, pages 37-49, 2001.
8. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510-1523, 1997.
9. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte Der Physik, 46(4-5):493-505, 1998.
10. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Jr. Samuel J. Lomonaco and Howard E. Brandt, editors, Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of Contemporary Mathematics Series. American Mathematical Society, 2002.
11. A. Broder and A. Karlin. Bounds on the cover time. Journal of Theoretical Probability, 2(1): 101-120, 1989.
12. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, M. Santha F. Magniez, and R. de Wolf. Quantum algorithms for element distinctness. SIAM Journal of Computing, 34(6):1324-1330, 2005.
13. H. Buhrman and R. Špalek. Quantum verification of matrix products. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pages 880-889, 2006.
14. A. Childs and J. Goldstone. Spatial search and the Dirac equation. Physical Review A, 70, 2004. Article No. 42312.
15. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca. Quantum algorithms revisited. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 454(1969):339-354, 1998.
16. L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th ACM Symposium on the Theory of Computing, pages 212-219, 1996.
17. P. Høyer, M. Mosca, and R. de Wolf. Quantum search on bounded-error inputs. In Verlag, editor, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 291-299. Verlag, 2003.
18. A. Kitaev. Quantum measurements and the abelian stabilizer problem. Technical Report quant-ph/9511026, arXiv, 1995.
19. F. Magniez and A. Nayak. Quantum complexity of testing group commutativity. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, volume 1770 of Lecture Notes in Computer Science, pages 1312-1324, 2005.
20. F. Magniez, M. Santha, and M. Szegedy. Quantum Algorithms for the Triangle Problem. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, 2005.
21. D. Meyer. From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics, 85(5-6):551-574, 1996.
22. A. Nayak and A. Vishwanath. Quantum walk on the line. Technical Report quant-ph/0010117, arXiv, 2000.
23. P. Richter. Almost uniform sampling via quantum walks. New Journal of Physics, 2007. To appear.
24. N. Shenvi, J. Kempe, and K.B. Whaley. Quantum random-walk search algorithm. Physical Review A, 67(052307), 2003.
25. M. Szegedy. Quantum Speed-Up of Markov Chain Based Algorithms. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 32-41, 2004.
26. U. Vazirani. On the power of quantum computation. Philosophical Transactions of the Royal Society of London, Series A, 356:1759-1768, 1998.
27. J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2):376-391, 2001.