On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Open accessThe DOI matches its Crossref record; 82 of the 82 references it cites were found in a registry or an index.
Abstract
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case.In this article, I describe a precise correspondence between continuous- and discrete- time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This Bayesian estimation approach to quantum phase estimation has recently been shown experimentally 278 , demonstrating its robustness to noise and decoherence.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [278]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2×
“Indeed, since Grover’s well-known search algorithm [30] can be interpreted as a quantum walk on the complete graph, amchilds@uwaterloo.”
BackgroundMethodLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“More generally, a Hamiltonian can be simulated efficiently provided it is sparse and efficiently row-computable.”
BackgroundCleve, R., Ekert, A., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,299
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 1×
“As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model.”
MethodQuantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodReversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 973
Locality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870 · cited 1×
“Suppose we color the edges of the graph of nonzero entries of H; then the subgraphs of any particular color consist of isolated edges, meaning that the evolution on any one of these subgraphs takes place in isolated two-dimensional subspaces, and is easily simulated.”
BackgroundExponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 6×
“For example, while the exponential speedup by continuous-time quantum walk described in [12] is generally suspected to carry over to the discrete-time model, the dynamics are more involved, and to the best of my knowledge no rigorous analysis has been provided so far.”
BackgroundInfluentialSelf-citationWEIL, A. A. (1948) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.34.5.204 · Cited by 801 · cited 1×
“A classic result of Weil says that, provided ψ is nontrivial and c 6= 0, the absolute value of the Kloosterman sum is at most 2√q [53].”
Background
Cited by
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
“Some variants of this idea are considered in [4, 12, 20].”
BackgroundMethodInfluentialQuantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Walks of Correlated Photons
Peruzzo, A., Lobino, M., Matthews, J. C. F., Matsuda, N., Politi, A., Poulios, K., Zhou, X.-Q., Lahini, Y., Ismail, N., Wörhoff, K., et al. (2010) · Science · doi:10.1126/science.1193515 · Cited by 929
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
“Child’s contribution In [110], Childs presents the following mathematical framework for simulating a continuous quantum walk as a limit ( − approximation) of discrete quantum walks (for the sake of clarity and readability of the original paper, we closely follow the notation used in [110]): (a) Let H be a general N ×…”
Method
Metadata
- Authors
- Childs, A. M.
- Affiliations
- University of Waterloo (CA)
- Corresponding author
- Childs, Andrew M.
- ORCID
- Childs, Andrew M.
- Venue
- Communications in Mathematical Physics
- Published
- 2009-10-10
- Volume
- 294
- Issue
- 2
- Pages
- 581-603
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2098948451
- Cited by
- 411
- References
- 70
- Citations by year
- 2026: 15 · 2025: 32 · 2024: 39 · 2023: 48 · 2022: 34 · 2021: 30 · 2020: 24 · 2019: 31 · 2018: 16 · 2017: 21 · 2016: 18 · 2015: 13 · 2014: 17 · 2013: 12 · 2012: 21
- FWCI
- 19.96
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Communications in Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (acceptedVersion)
- arXiv (Cornell University)
- Funders
- Mitacs
- Natural Sciences and Engineering Research Council of Canada
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- continuous-time quantum walks, discrete-time quantum walks, Hamiltonian simulation, element distinctness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Relationship Between Continuous- and Discrete-Time Quantum Walk. https://app.cochat.ai/papers/10.1007/s00220-009-0930-1
- The paper
- Childs, A. M. (2010). On the Relationship Between Continuous- and Discrete-Time Quantum Walk. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-009-0930-1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.