One-dimensional quantum walks with absorbing boundaries
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
In this paper we analyze the behavior of quantum random walks. In particular, we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these probabilities both by employing generating functions and by use of an eigenfunction approach. The generating function method is used to determine some simple properties of the walks we consider, but appears to have limitations. The eigenfunction approach works by relating the problem of absorption to a unitary problem that has identical dynamics inside a certain domain, and can be used to compute several additional interesting properties, such as the time dependence of absorption. The eigenfunction method has the distinct advantage that it can be extended to arbitrary dimensionality. We outline the solution of the absorption probability problem of a (D-1)-dimensional wall in a D-dimensional space.
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.
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
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×
“(Continuous-time variants of quantum walks have also been proposed and exhibit significant differences from classical continuous random walks [5, 7].”
BackgroundAharonov, 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 · cited 4×
“Although there has been some work on quantum walks on general graphs [2], many questions about quantum walks on general graphs appear to be quite difficult to answer at the present time.”
BackgroundMethodInfluentialAmbainis, 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 · cited 7×
“[3], and the eigenfunction method has been used by others to address periodic systems [3, 14, 2, 18].”
BackgroundMethodInfluentialSelf-citationFrom quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
An Example of the Difference Between Quantum and Classical Random Walks
Childs, A. M., Farhi, E., & Gutmann, S. (2002) · Quantum Information Processing · doi:10.1023/a:1019609420309 · Cited by 481
Quantum walks in higher dimensions
Mackay, T. D., Bartlett, S. D., Stephenson, L. T., & Sanders, B. C. (2002) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/35/12/304 · Cited by 255 · cited 1×
“1 Introduction Several recent papers have studied the properties of quantum walks, which are quantum computational variants of discrete-time random walks [2, 3, 8, 9, 11, 12, 13, 17, 19].”
BackgroundDiscrete Quantum Walks Hit Exponentially Faster
Kempe, J. (2005) · Probability Theory and Related Fields · doi:10.1007/s00440-004-0423-2 · Cited by 152
Quantum mechanics of lattice gas automata: One-particle plane waves and potentials
Meyer, D. A. (1997) · Physical Review E · doi:10.1103/physreve.55.5261 · Cited by 101 · cited 4×
“[3],and the eigenfunction method has been used by others to address periodic systems [3, 13, 14, 16, 2, 20] as well as systems with potential steps [13, 14 ].”
BackgroundMethodInfluential
Cited by
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
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
Universal quantum computation using the discrete-time quantum walk
Lovett, N. B., Cooper, S., Everitt, M., Trevers, M., & Kendon, V. (2010) · Physical Review A · doi:10.1103/physreva.81.042330 · Cited by 510
Metadata
- Authors
- Bach, E., Coppersmith, S., Goldschen, M. P., Joynt, R., & Watrous, J.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2004-12
- Volume
- 69
- Issue
- 4
- Pages
- 562-592
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2154773309
- Cited by
- 135
- References
- 8
- FWCI
- 5.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.