Open Quantum Random Walks
Open accessThe DOI matches its Crossref record; 53 of the 56 references it cites were found in a registry or an index.
Abstract
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains. We explore the “quantum trajectory” point of view on these quantum random walks, that is, we show that measuring the position of the particle after each time-step gives rise to a classical Markov chain, on the lattice times the state space of the particle. This quantum trajectory is a simulation of the master equation of the quantum random walk. The physical pertinence of such quantum random walks and the way they can be concretely realized is discussed. Differences and connections with the already well-known quantum random walks, such as the Hadamard random walk, are established.
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?
The cited source says what the claim attributes to it.
In the citing paper
“has produced noteworthy advances in quantum random walks, 38,39 quantum control, 40 open quantum systems, 41 and pioneering work on quantum neural networks, 42 quantum machine learning, 43 and quantum processes in the brain.44”
From Toward a quantum future for South Africa (2021) · cites this paper as [38]
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
An Introduction to Probability Theory and Its Applications.
Bharucha-Reid, A. T., & Feller, W. (1967) · The American Mathematical Monthly · doi:10.2307/2314609 · Cited by 6,066
The Theory of Open Quantum Systems
Breuer, H.-P., & Petruccione, F. (2007) · doi:10.1093/acprof:oso/9780199213900.001.0001 · Cited by 5,938 · cited 2×
“The formalism suggested is similar to the formalism of quantum Markov chains [42, 43] and rests upon the implementation of appropriate completely positive maps [19, 44, 45].”
BackgroundMethodSelf-citationTheory of open quantum systems
Xu, R., & Yan, Y. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1474579 · Cited by 5,922
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Berg, H. C. (2025) · Princeton University Press eBooks · doi:10.1515/9780691279886 · Cited by 2,367
States, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,928 · cited 1×
“The formalism suggested is similar to the formalism of quantum Markov chains [42, 43] and rests upon the implementation of appropriate completely positive maps [19, 44, 45].”
MethodA Random Walk Down Wall Street
Malkiel, B. G. (1973) · Medical Entomology and Zoology · Cited by 1,751
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
Research works printed but not linked: 10
- Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: In: Proceedings of the 33rd ACM Symposium on Theory of Computing, p. 50 (2001)
- Childs, A., Cleve, R., Deotto, E., Farhi, E.: In: Proceedings of the 35th ACM Symposium on Theory of Computing, p. 59 (2003)
- Farhi, E., Goldstone, J., Gutmann, S.: Theory Comput. 4, 169 (2008) · doi:10.4086/toc.2008.v004a008
- Schmitz, H., Matjeschk, R., Schneider, Ch., Glueckert, J., Enderlein, M., Huber, T., Schaetz, T.: Phys. Rev. Lett. 103, 090504 (2009)
- Plenio, M., Huelga, S.: New J. Phys. 10, 113019 (2008)
- Brun, T.A., Carteret, H.A., Ambainis, A.: Phys. Rev. Lett. 91, 130602 (2003)
- Broome, M.A., et al.: Phys. Rev. Lett. 104, 153602 (2010) · DOI · Paper page
- Ahlbrecht, A., Vogts, H., Werner, A.H., Werner, R.F.: J. Math. Phys. 52, 042201 (2011)
- Gudder, S.: J. Math. Phys. 49, 072105 (2008)
- Attal, S., Guillotin-Plantard, N., Sabot, C.: Central-Limit Theorems for open quantum random walks. Preprint
Cited by
Quantum walk and its application domains: A systematic review
Kadian, K., Garhwal, S., & Kumar, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100419 · Cited by 204
Quantum Walk Computing: Theory, Implementation, and Application
Qiang, X., Ma, S., & Song, H. (2024) · Intelligent Computing · doi:10.34133/icomputing.0097 · Cited by 92
Central Limit Theorems for Open Quantum Random Walks and Quantum Measurement Records
Attal, S., Guillotin‐Plantard, N., & Sabot, C. (2014) · Annales Henri Poincaré · doi:10.1007/s00023-014-0319-3 · Cited by 87
“Our presentation here is slightly different from the one of [2], for we have adapted our notations to the simpler context that we are studying here.”
BackgroundInfluentialSelf-citationOpen Quantum Random Walks: Reducibility, Period, Ergodic Properties
Carbone, R., & Pautrat, Y. (2015) · Annales Henri Poincaré · doi:10.1007/s00023-015-0396-y · Cited by 68
“As noted in [3], classical Markov chains can be written as open quantum random walks.”
BackgroundInfluentialDynamical localization for d-dimensional random quantum walks
Joye, A. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0406-7 · Cited by 57
Metadata
- Authors
- Attal, S., Petruccione, F., Sabot, C., & Sinayskiy, I.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- National Institute for Theoretical Physics (ZA)
- Corresponding author
- Attal, S.
- Venue
- Journal of Statistical Physics
- Published
- 2012-05-31
- Volume
- 147
- Issue
- 4
- Pages
- 832-852
- ISSN
- 0022-4715 (ISSN-L)
- 1572-9613
- OpenAlex
- W2104788735
- Cited by
- 165
- References
- 56
- Citations by year
- 2026: 9 · 2025: 12 · 2024: 10 · 2023: 16 · 2022: 10 · 2021: 13 · 2020: 9 · 2019: 17 · 2018: 9 · 2017: 9 · 2016: 10 · 2015: 14 · 2014: 14 · 2013: 7 · 2012: 5
- FWCI
- 12.60
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Statistical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- Agence Nationale de la Recherche (ANR-09-BLAN-0098)
- 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, open quantum systems, quantum trajectories, Markov chains, master equation, lattices, finite graphs, quantum measurement
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: Open Quantum Random Walks. https://app.cochat.ai/papers/10.1007/s10955-012-0491-0
- The paper
- Attal, S., Petruccione, F., Sabot, C., & Sinayskiy, I. (2012). Open Quantum Random Walks. Journal of Statistical Physics. https://doi.org/10.1007/s10955-012-0491-0
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.