Abstract
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
Similar content being viewed by others
REFERENCES
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).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Childs, A.M., Farhi, E. & Gutmann, S. An Example of the Difference Between Quantum and Classical Random Walks. Quantum Information Processing 1, 35–43 (2002). https://doi.org/10.1023/A:1019609420309
Issue Date:
DOI: https://doi.org/10.1023/A:1019609420309