An Example of the Difference Between Quantum and Classical Random Walks

Quantum Information Processing - Tập 1 - Trang 35-43 - 2002
Andrew M. Childs1, Edward Farhi1, Sam Gutmann2
1Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge
2Department of Mathematics, Northeastern University, Boston

Tóm tắt

In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case. PACS: 03.67.Hk

Tài liệu tham khảo

E. Farhi and S. Gutmann, Phys. Rev. A 58, 915 (1998). E. Farhi and S. Gutmann, Ann. Phys. 213, 182 (1992). D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, quant-ph/0012090. Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A 48, 1687 (1993). A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, in Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 2001), p. 37. D. A. Meyer, Phys. Lett. A 223, 337 (1996).