arXiv Analytics

Sign in

arXiv:quant-ph/0203043AbstractReferencesReviewsResources

Parrondo Games and Quantum Algorithms

Chiu Fan Lee, Neil Johnson

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
arXiv:quant-ph/0005003 (Published 2000-04-29, updated 2001-07-06)
Introduction to Quantum Algorithms
arXiv:1209.3917 [quant-ph] (Published 2012-09-18, updated 2013-10-10)
The Topology of Quantum Algorithms