Parrondo Games and Quantum Algorithms
arXiv:quant-ph/0203043
Abstract
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.
7 pages, no figures