Parrondo Games and Quantum Algorithms

Simple item page
dc.creatorLee, Chiu Fan
dc.creatorJohnson, Neil
dc.date2002-03-10
dc.date.accessioned2026-07-07T06:03:49Z
dc.date.available2026-07-07T06:03:49Z
dc.descriptionWe 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.
dc.description7 pages, no figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0203043
dc.identifierhttp://arxiv.org/abs/quant-ph/0203043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90082
dc.subjectQuantum Physics
dc.titleParrondo Games and Quantum Algorithms
dc.typetext

Files

Collections

arXiv