Position-dependent and cooperative quantum Parrondo walks
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
This work is a study on quantum computational formulations of Parrondo walks, that is, positively trending random walks formed as combinations of negatively trending random walks. We reanalyse the position-dependent walk proposed by Košík et al (2007 J. Mod. Opt. 54 2275), correcting the parameter choices in that paper to achieve the Parrondo effect. We also devise a quantum analogue of the cooperative Parrondo walk of Toral (2002 Fluct. Noise Lett. 2 L305), in which it is the interaction between multiple participants, rather than position-dependence, that allows the Parrondo effect to occur. We give a general formulation of a quantum analogue of the classical walk of Toral (2002 Fluct. Noise Lett. 2 L305), and demonstrate the Parrondo effect numerically. Lastly, we highlight a qualitative difference in asymptotic behaviour between quantum Parrondo walks and their classical counterparts. In particular, we draw attention to an intuitive but unreliable assumption, based on classical random walks, which may pose extra challenges for applications of the Parrondo effect in the quantum setting seeking to separate or classify data or particles.
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
“The 2D graphs that can be realized with this technique allow the study of new quantum walk phenomena, such as wave communication [20], cooperative quantum games [21] and the creation of topological phases in 2D [22].”
From Two-photon quantum walks in an elliptical direct-write waveguide array (2011) · cites this paper as [21]
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 Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
An introduction to ROC analysis
Fawcett, T. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.10.010 · Cited by 21,879
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
Rubinstein, R. Y., & Kroese, D. P. (2004) · Information Science and Statistics · doi:10.1007/978-1-4757-4321-0 · Cited by 597
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 Gases
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 488
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
Research works printed but not linked: 1
- Ambianis A, Bach E, Nayak A, Vishwanath A and Watrous J 2001 Proc. 33rd ACM Symp. on Theory of Computing p 37
Cited by
Two-photon quantum walks in an elliptical direct-write waveguide array
Owens, J. O., Broome, M. A., Biggerstaff, D. N., Goggin, M. E., Fedrizzi, A., Linjordet, T., Ams, M., Marshall, G. D., Twamley, J., Withford, M. J., et al. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/7/075003 · Cited by 135
Self-citationParrondo’s paradox from classical to quantum: A review
Lai, J. W., & Cheong, K. H. (2020) · Nonlinear Dynamics · doi:10.1007/s11071-020-05496-8 · Cited by 78
“With this formalism, the authors were able to show that the combination of two “losing” subwalks gives a “winning” subwalk—Parrondo’s effect [69].”
BackgroundMethodInfluentialParrondoʼs game using a discrete-time quantum walk
Chandrashekar, C. M., & Banerjee, S. (2011) · Physics Letters A · doi:10.1016/j.physleta.2011.02.071 · Cited by 42
Parrondo effect in quantum coin-toss simulations
Lai, J. W., & Cheong, K. H. (2020) · Physical review. E · doi:10.1103/physreve.101.052212 · Cited by 40
Cooperative quantum Parrondo’s games
Pawela, Ł., & Sładkowski, J. (2013) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2013.04.010 · Cited by 32
Metadata
- Authors
- Bulger, D., Freckleton, J., & Twamley, J.
- Affiliations
- Macquarie University (AU)
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2008-09-12
- Volume
- 10
- Issue
- 9
- Pages
- 093014
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2083008652
- Cited by
- 20
- References
- 31
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 1 · 2020: 3 · 2017: 2 · 2016: 3 · 2015: 1 · 2014: 2 · 2013: 1
- FWCI
- 1.06
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- 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, asymptotic behavior, quantum computing
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: Position-dependent and cooperative quantum Parrondo walks. https://app.cochat.ai/papers/10.1088/1367-2630/10/9/093014
- The paper
- Bulger, D., Freckleton, J., & Twamley, J. (2008). Position-dependent and cooperative quantum Parrondo walks. New Journal of Physics. https://doi.org/10.1088/1367-2630/10/9/093014
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.