Quantum Implementation of Parrondo's Paradox

Simple item page
dc.creatorMiszczak, J. A.
dc.creatorGawron, P.
dc.date2005-02-28
dc.date2005-12-07
dc.date.accessioned2026-07-07T10:02:58Z
dc.date.available2026-07-07T10:02:58Z
dc.descriptionWe propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.
dc.description6 figures, revtex4
dc.identifierhttps://arxiv.org/abs/quant-ph/0502185
dc.identifierhttp://arxiv.org/abs/quant-ph/0502185
dc.identifierFluctuation and Noise Letters, Vol. 5, No. 4 (2005)
dc.identifierdoi:10.1142/S0219477505002902
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169159
dc.subjectQuantum Physics
dc.subjectComputer Science and Game Theory
dc.titleQuantum Implementation of Parrondo's Paradox
dc.typetext

Files

Collections

arXiv