We study a quantum walk in one-dimension using two different “coin” operators. By mixing two operators, both of which give a biased walk with negative expectation value for the walker position, it is possible to reverse the bias through interference effects. This effect is analogous to that in Parrondo’s games, where alternating two losing (gambling) games can produce a winning game. The walker bias is produced by introducing a phase factor into the coin operator, with two different phase factors giving games A and B. We give the range of phases for which the Parrondo effect can be obtained with A and B played alternately or in other (repeated) deterministic sequences. The effect is transitory. For sufficiently large times the original bias resumes.
[1]
G. G. Stokes.
"J."
,
1890,
The New Yale Book of Quotations.
[2]
Peter van Emde Boas,et al.
SOFSEM 2004: Theory and Practice of Computer Science
,
2004,
Lecture Notes in Computer Science.
[3]
Clement Ampadu.
A Quantum Analogue of Parrondo's Game
,
2011,
ArXiv.
[4]
Mária Bieliková,et al.
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings
,
2008,
SOFSEM.
[5]
Rajeev Motwani,et al.
Randomized algorithms
,
1996,
CSUR.