Parrondo Games and Quantum Algorithms
Quantum Physics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.quant-ph/0203043,
title = {Parrondo Games and Quantum Algorithms},
author = {Chiu Fan Lee and Neil Johnson},
journal= {arXiv preprint arXiv:quant-ph/0203043},
year = {2007}
}
Comments
7 pages, no figures