The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
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.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Irreversibility and heat generation in the computing process
Landauer, R. (1961) · IBM Journal of Research and Development · doi:10.1147/rd.53.0183 · Cited by 4,980
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Cited by
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
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
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
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
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
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
Self-citationOn 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
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Quantum Algorithms for the Triangle Problem
Magniez, F., Santha, M., & Szegedy, M. (2007) · SIAM Journal on Computing · doi:10.1137/050643684 · Cited by 311
Magniez, F., Nayak, A., Roland, J., & Santha, M. (2011) · SIAM Journal on Computing · doi:10.1137/090745854 · Cited by 294
Decoherence in quantum walks – a review
KENDON, V. (2007) · Mathematical Structures in Computer Science · doi:10.1017/s0960129507006354 · Cited by 252
Decoherence can be useful in quantum walks
Kendon, V., & Tregenna, B. (2003) · Physical Review A · doi:10.1103/physreva.67.042315 · Cited by 223
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
Spatial search and the Dirac equation
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146
Paparo, G. D., & Martin-Delgado, M. A. (2012) · Scientific Reports · doi:10.1038/srep00444 · Cited by 136
Entanglement in coined quantum walks on regular graphs
Carneiro, I., Loo, M., Xu, X., Girerd, M., Kendon, V., & Knight, P. L. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/156 · Cited by 128
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
Quantum Query Complexity of Some Graph Problems
Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27836-8_42 · Cited by 72
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
Metadata
- Authors
- Watrous, J.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2001-03
- Volume
- 62
- Issue
- 2
- Pages
- 376-391
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1872909421
- Cited by
- 216
- References
- 7
- FWCI
- 9.76
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.