arXiv:quant-ph/0203043AbstractReferencesReviewsResources
Parrondo Games and Quantum Algorithms
Published 2002-03-10Version 1
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.
Comments: 7 pages, no figures
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0112152 (Published 2001-12-23)
From Monte Carlo to Quantum Computation
Introduction to Quantum Algorithms
The Topology of Quantum Algorithms