The meeting problem in the quantum walk
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The results are compared to the corresponding classical problem and differences are pointed out. Analytic formulas for the meeting probability and its asymptotic behavior are derived. The decay of the meeting probability for distinguishable particles is faster then in the classical case, but not quadratically faster. Entangled initial states and the bosonic or fermionic nature of the walkers are considered.
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
“Moreover, the differences in the meeting probability can be found also in the asymptotic regime. However, the quantum effects on the long-time scale are much more subtle, as discussed in detail in Ref. [20].”
From Multi-walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation (2011) · cites this paper as [20]
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
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
Owen, D. B., Abramowitz, M., & Stegun, I. A. (1965) · Technometrics · doi:10.2307/1266136 · Cited by 16,138
Aharonov, Y., Davidovich, L., & Zagury, N. (1993) · Physical Review A · doi:10.1103/physreva.48.1687 · Cited by 1,622
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
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 random walks - an introductory overview
Kempe, J., & Einstein, A. (2003) · Cited by 1,035
Coherent Transport of Neutral Atoms in Spin-Dependent Optical Lattice Potentials
Mandel, O., Greiner, M., Widera, A., Rom, T., Hänsch, T. W., & Bloch, I. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.010407 · Cited by 477
Quantum Walk on the LinePreprint
Ashwin, N., & Vishwanath, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0010117 · Cited by 371
Implementing the quantum random walk
Travaglione, B. C., & Milburn, G. J. (2002) · Physical Review A · doi:10.1103/physreva.65.032310 · Cited by 295
Research works printed but not linked: 1
- Childs A M Cleve R Deotto E Fahri E Gutman S Spielman D A, 2003, Proc. 35th Symposium on the Theory of Computing, 59
Cited by
Two-particle quantum walks: Entanglement and graph isomorphism testing
Berry, S. M., & Wang, J. B. (2011) · Physical Review A · doi:10.1103/physreva.83.042317 · Cited by 161
Konno, N. (2008) · Lecture notes in mathematics · doi:10.1007/978-3-540-69365-9_7 · Cited by 252
Rohde, P. P., Schreiber, A., Štefaňák, M., Jex, I., & Silberhorn, C. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/1/013001 · Cited by 81
Self-citationCounting statistics of many-particle quantum walks
Mayer, K., Tichy, M. C., Mintert, F., Konrad, T., & Buchleitner, A. (2011) · Physical Review A · doi:10.1103/physreva.83.062307 · Cited by 75
Directional correlations in quantum walks with two particles
Štefaňák, M., Barnett, S. M., Kollár, B., Kiss, T., & Jex, I. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/3/033029 · Cited by 43
Self-citation
Metadata
- Authors
- Štefanák, M., Kiss, T., Jex, I., & Mohring, B.
- Affiliations
- Institute for Solid State Physics and Optics (HU)
- Czech Technical University in Prague (CZ)
- Universität Ulm (DE)
- Venue
- Journal of Physics A: Mathematical and General
- Publisher
- IOP Publishing
- Published
- 2006-11-15
- Volume
- 39
- Issue
- 48
- Pages
- 14965-14983
- ISSN
- 0305-4470 (ISSN-L)
- 1361-6447
- OpenAlex
- W2082859078
- Cited by
- 24
- References
- 29
- Citations by year
- 2025: 1 · 2024: 2 · 2023: 1 · 2022: 1 · 2020: 2 · 2018: 2 · 2017: 1 · 2016: 1 · 2015: 2 · 2013: 1 · 2012: 1
- FWCI
- 0.76
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Physics A Mathematical and General (publishedVersion)
- arXiv (Cornell University) (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, distinguishable particles, bosons and fermions, asymptotic behavior, quantum-classical comparison, non-interacting particles
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: The meeting problem in the quantum walk. https://app.cochat.ai/papers/10.1088/0305-4470/39/48/009
- The paper
- Štefanák, M., Kiss, T., Jex, I., & Mohring, B. (2006). The meeting problem in the quantum walk. Journal of Physics A: Mathematical and General. https://doi.org/10.1088/0305-4470/39/48/009
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.