Abstract
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of our expository article is on analyzing these processes using the Laplace transform on the stochastic recurrences. The resulting time evolution equations, classical vs. quantum, are strikingly similar in form, although dissimilar in behavior. We also provide comparisons with analyses performed using spectral methods.
PACS: 03.67.Lx
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
A. Ambainis, Quantum walk algorithm for element distinctness, quant-ph/0311001.
Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. Lett. 48(2), 1687 (1993)
M. Abramowitz and I. Stegun, Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables (Dover, 1974).
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, Quantum Walks on Graphs, in Proceedings of 33rd ACM Annual Symposium Theory of Computing (ACM Press, 2001), pp. 50–59.
A. Ambainis, E. Bach, A. Nayak, A. Viswanath, and J. Watrous, One-dimensional Quantum Walks, in Proceedings of 33rd ACM Annual Symposium Theory of Computing (ACM Press, 2001), pp. 37–49.
A. Ahmadi, R. Belk, C. Tamon, and C. Wendler, Quantum Inform. Comput. 3(6), 611 (2003).
K. L. Chung, Markov Chains with Stationary Transition Probabilities, 2nd edn. (Springer, 1967).
A. Childs, E. Farhi, and S. Gutmann, Quantum Inform. Process. 1, 35 (2002).
A. Childs, E. Deotto, R. Cleve, E. Farhi, S. Gutmann, and D. Spielman, Exponential algorithmic speedup by quantum walk, in Proceedings of 35th ACM Annual Symposium Theory of Computing (ACM Press, 2003), pp. 59–68.
A. Childs, and J. Goldstone, quant-ph/0306054 (2003).
E. Farhi, and S. Gutmann, Phys. Rev. A 58, 915 (1998).
R. Feynman, R. Leighton, and M. Sands, The Feynman Lectures on Physics, Vol. III (Addison-Wesley, 1965).
H. Gerhardt and J. Watrous, Continuous-time quantum walks on the symmetric group, in Proceedings 7th International Workshop on Randomization and Approximation Techniques in Computer Science, LNCS 2764 (Springer, 2003) pp. 290–301.
J. Kempe, Quantum Random walks hit exponentially faster, in Proceedings 7th International Workshop Randomization and Approximation Techniques in Computer Science, LNCS 2764 (Springer, 2003), pp. 354–369.
D. Meyer, J. Stat. Phys., 85, 551 (1996).
C. Moore and A. Russell, Quantum walks on the hypercube, in Proceedings 6th International Workshop on Randomization and Approximation Techniques in Computer Science, LNCS 2483 (Springer, 2002), pp. 164–178.
F. Spitzer, Principles of Random Walk, 2nd edn. (Springer, 1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
ben-Avraham, D., Bollt, E. & Tamon, C. One-Dimensional Continuous-Time Quantum Walks. Quantum Information Processing 3, 295–308 (2004). https://doi.org/10.1007/s11128-004-9420-8
Issue Date:
DOI: https://doi.org/10.1007/s11128-004-9420-8