The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
An Example of the Difference Between Quantum and Classical Random Walks
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The continuous-time quantum walks model has not been thoroughly investigated for Dirac dynamics.
“While DTQW and DCA are well-explored for Dirac dynamics, the continuous-time quantum walks (CTQW) [18] model has not been thoroughly investigated.”
From Quantum Entanglement in Dirac Dynamics via Continuous-Time Quantum Walks in a Quantum Circuit Framework (2024) · cites this paper as [18]
Many works have compared properties of stochastic and quantum random walks on complex networks.
“many works have compared properties of stochastic 68,69 and quantum random walks 63 -65 on complex networks 70 .”
From Complex networks from classical to quantum (2019) · cites this paper as [63]
For some graphs, hitting time of quantum walks can be exponentially less than their classical counterparts.
“For some graphs, hitting time of quantum walks can be exponentially less than their classical counterparts. 48,49”
From Quantum algorithms: an overview (2016) · cites this paper as [48]
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
Aharonov, Y., Davidovich, L., & Zagury, N. (1993) · Physical Review A · doi:10.1103/physreva.48.1687 · Cited by 1,622
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Self-citationAharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562
From Quantum Cellular Automata To Quantum Lattice GasesPreprint
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · Cited by 502
Quantum Walk on the LinePreprint
Ashwin, N., & Vishwanath, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0010117 · Cited by 200
On the absence of homogeneous scalar unitary cellular automata
MEYER, D. A. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00745-1 · Cited by 112
The functional integral constructed directly from the hamiltonian
Farhi, E., & Gutmann, S. (1992) · Annals of Physics · doi:10.1016/0003-4916(92)90288-w · Cited by 38
Self-citation
Flagged first, then by citations
Research works printed but not linked: 2
- D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, quant-ph/0012090. · arXiv
- 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.
Cited by
Sorted by citations
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Environment-assisted quantum walks in photosynthetic energy transfer
Mohseni, M., Rebentrost, P., Lloyd, S., & Aspuru-Guzik, A. (2008) · The Journal of Chemical Physics · doi:10.1063/1.3002335 · Cited by 1,189
Perfect State Transfer in Quantum Spin Networks
Christandl, M., Datta, N., Ekert, A., & Landahl, A. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.187902 · Cited by 1,179
Quantum 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
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“For some graphs, hitting time of quantum walks can be exponentially less than their classical counterparts [27, 54].”
Exponential 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
Self-citationEnvironment-assisted quantum transport
Rebentrost, P., Mohseni, M., Kassal, I., Lloyd, S., & Aspuru-Guzik, A. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033003 · Cited by 817
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632
Aharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562
Perfect transfer of arbitrary states in quantum spin networks
Christandl, M., Datta, N., Dorlas, T. C., Ekert, A., Kay, A., & Landahl, A. J. (2005) · Physical Review A · doi:10.1103/physreva.71.032312 · Cited by 512
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Self-citationAdiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Implementing the quantum random walk
Travaglione, B. C., & Milburn, G. J. (2002) · Physical Review A · doi:10.1103/physreva.65.032310 · Cited by 295
Ryan, C. A., Laforest, M., Boileau, J. C., & Laflamme, R. (2005) · Physical Review A · doi:10.1103/physreva.72.062317 · Cited by 280
Quantum walks driven by many coins
Brun, T. A., Carteret, H. A., & Ambainis, A. (2003) · Physical Review A · doi:10.1103/physreva.67.052317 · Cited by 186
Connecting the discrete- and continuous-time quantum walks
Strauch, F. W. (2006) · Physical Review A · doi:10.1103/physreva.74.030301 · Cited by 180
Attal, S., Petruccione, F., Sabot, C., & Sinayskiy, I. (2012) · Journal of Statistical Physics · doi:10.1007/s10955-012-0491-0 · Cited by 165
Discrete Quantum Walks Hit Exponentially Faster
Kempe, J. (2005) · Probability Theory and Related Fields · doi:10.1007/s00440-004-0423-2 · Cited by 152
Two-particle quantum walks applied to the graph isomorphism problem
Gamble, J. K., Friesen, M., Zhou, D., Joynt, R., & Coppersmith, S. N. (2010) · Physical Review A · doi:10.1103/physreva.81.052313 · Cited by 145
Complex networks from classical to quantum
Biamonte, J., Faccin, M., & De Domenico, M. (2019) · Communications Physics · doi:10.1038/s42005-019-0152-6 · Cited by 149
Experimental realization of a quantum quincunx by use of linear optical elements
Do, B., Stohler, M. L., Balasubramanian, S., Elliott, D. S., Eash, C., Fischbach, E., Fischbach, M. A., Mills, A., & Zwickl, B. (2005) · Journal of the Optical Society of America B · doi:10.1364/josab.22.000499 · Cited by 128
Quantum walks on a random environment
Yin, Y., Katsanos, D. E., & Evangelou, S. N. (2008) · Physical Review A · doi:10.1103/physreva.77.022302 · Cited by 120
Quantum stochastic walks: A generalization of classical random walks and quantum walks
Whitfield, J. D., Rodríguez-Rosario, C. A., & Aspuru-Guzik, A. (2010) · Physical Review A · doi:10.1103/physreva.81.022323 · Cited by 126
Localization and its consequences for quantum walk algorithms and quantum communication
Keating, J. P., Linden, N., Matthews, J. C. F., & Winter, A. (2007) · Physical Review A · doi:10.1103/physreva.76.012315 · Cited by 123
Fast escape of a quantum walker from an integrated photonic maze
Caruso, F., Crespi, A., Ciriolo, A. G., Sciarrino, F., & Osellame, R. (2016) · Nature Communications · doi:10.1038/ncomms11682 · Cited by 105
One- and two-dimensional quantum walks in arrays of optical traps
Eckert, K., Mompart, J., Birkl, G., & Lewenstein, M. (2005) · Physical Review A · doi:10.1103/physreva.72.012327 · Cited by 74
Free-Dirac-particle evolution as a quantum random walk
Bracken, A. J., Ellinas, D., & Smyrnakis, I. (2007) · Physical Review A · doi:10.1103/physreva.75.022322 · Cited by 60
Relativistic effects and rigorous limits for discrete- and continuous-time quantum walks
Strauch, F. W. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2759837 · Cited by 54
Universally optimal noisy quantum walks on complex networks
Caruso, F. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/5/055015 · Cited by 54
Quantum walks, quantum gates, and quantum computers
Hines, A. P., & Stamp, P. C. E. (2007) · Physical Review A · doi:10.1103/physreva.75.062321 · Cited by 54
Asymptotic entanglement in 2D quantum walks
Annabestani, M., Abolhasani, M. R., & Abal, G. (2010) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/43/7/075301 · Cited by 46
Thermodynamic formalism for dissipative quantum walks
Garnerone, S. (2012) · Physical Review A · doi:10.1103/physreva.86.032342 · Cited by 23
Position-dependent and cooperative quantum Parrondo walks
Bulger, D., Freckleton, J., & Twamley, J. (2008) · New Journal of Physics · doi:10.1088/1367-2630/10/9/093014 · Cited by 20
Evanescence in coined quantum walks
Carteret, H. A., Richmond, B., & Temme, N. M. (2005) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/38/40/011 · Cited by 14
Wang, W.-T., Chang, Y.-J., & Chang, C. R. (2024) · arXiv · doi:10.48550/arxiv.2411.04540
“While DTQW and DCA are well-explored for Dirac dynamics, the continuous-time quantum walks (CTQW) [18] model has not been thoroughly investigated.”
Background
Metadata
- Authors
- Childs, A. M., Farhi, E., & Gutmann, S.
- Affiliations
- Massachusetts Institute of Technology (US)
- Northeastern University (US)
- Venue
- Quantum Information Processing
- Published
- 2002-04
- Volume
- 1
- Issue
- 1-2
- Pages
- 35-43
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W1519689626
- Cited by
- 481
- References
- 8
- Citations by year
- 2026: 9 · 2025: 13 · 2024: 24 · 2023: 21 · 2022: 24 · 2021: 23 · 2020: 17 · 2019: 19 · 2018: 14 · 2017: 18 · 2016: 20 · 2015: 13 · 2014: 18 · 2013: 15 · 2012: 19
- FWCI
- 26.29
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Quantum Information Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum walks, classical random walks, graphs, exponential speedup
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
