Discrete quantum walks hit exponentially faster

Probability Theory and Related Fields

Volumn 133, Issue 2, 2005, Pages 215-235

  Kempe, Julia ^a,b  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24644478594     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-004-0423-2     Document Type: Article

References (28)

1. [AAKV01] Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of 33rd ACM STOC, ACM, New York, NY, pp. 50-59, 2001
2. +01] Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of 33rd ACM STOC, ACM, New York, NY, pp. 60-69, 2001
3. [AF] Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs. Unpublished, preprint available at http://stat-www.berkeley.edu/users/aldous/book.html.
4. [BBBV97] Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. Siam J. Comput. 26, 1510-1523, (1997)
5. +03] Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D. A.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of 35th ACM STOC, pp. 59-68, 2003
6. [CFG02] Childs, A., Farhi, E., Gutmann, S. : An example of the difference between quantum and classical random walks. Quantum Information Processing 1, 35 (2002)
7. [DFK91] Dyer, M., Frieze, A., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38 (1), 1-17 January (1991)
8. [FG98] Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915-928 (1998)
9. [Gro96] Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM STOC, pages 212-219, Philadelphia, Pennsylvania, ACM Press, 1996
10. [GSVV01] Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In: Proceedings of the 33rd ACM STOC, pp. 68-74, 2001
11. [HRT00] Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. In: Proceedings of the 32nd ACM STOC, pp. 627-635, 2000
12. [HSW02] Hofmeister, T., Schöning, U., Watanabe, O.: A probabilistic 3-SAT algorithm further improved. In: Helmut Alt and Afonso Ferreira, (eds.), STAGS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, volume 2285 of Lecture Notes in Computer Science pp. 192-202. Springer, 2002
13. [JS89] Jerrum, M., Sinclair, A.: Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82 (1) 93-133 (1989)
14. [JSV01] Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: Proceedings of the 33rd ACM STOC, ACM, New York, NY, pp. 712-721, 2001
15. [Kem03a] Kempe, J.: Quantum random walks - an introductory overview. Contemporary Physics 44 (4), 302-327 (2003)
16. [Kem03b] Kempe, J.: Quantum walks hit exponentially faster. In: RANDOM-APPROX 2003, Lecture Notes in Computer Science, Heidelberg, Springer, pp. 354-369, 2003
17. [Mey96] Meyer, D.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551-574 (1996)
18. [MR95] Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, 1995
19. [MR02] Moore, C., Russell, A.: Quantum walks on the hypercube. In: Proc. RANDOM 2002, Lecture Notes in Computer Science, Cambridge, MA, Springer, pp. 164-178, 2002
20. [NC00] Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK, 2000
21. [Pap94] Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading, Massachusetts, 1994
22. [Sch99] Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: 40th Annual Symposium on Foundations of Computer Science, IEEE, pp. 410-414, 1999
23. [Sho97] Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp. 26 (5), 1484-1509 (1997)
24. [Sim97] Simon, D.: On the power of quantum computation. SIAM J. Comp. 26 (5), 1474-1483 (1997)
25. [SKW03] Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Phys. Rev. A 67 (5), 052307 (2003)
26. [Wat01] Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. J. Comp. Sys. Sci. 62 (2), 376-391 (2001)
27. [Yam] Yamasaki, T.: private communication.
28. [YKI02] Yamasaki, T., Kobayashi, H., Imai, H.: An analysis of absorbing times of quantum walks. In: C. Calude, M.J. Dinneen, and F. Peper, editors, Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings, volume 2509 of Lecture Notes in Computer Science, Springer, pp. 315-330, 2002