2003/11/04 by Adrian P. Flitney, Derek Abbott, Neil F. Johnson · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #quant-ph
paper · pdf · doi:10.1088/0305-4470/37/30/013
published as J. Phys. A 37 (2004) 7581-7591 · 8 pages, 6 figures, RevTeX
arxiv created 2003/11/04 · openalex publication_date 2004/07/15 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
We introduce a multi-coin discrete quantum walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying the history dependence. By mixing the biased walk with an unbiased one, the direction of the bias can be reversed leading to a new quantum version of Parrondo's paradox.