Quantum Implementation of Parrondo's Paradox
<|reference_start|>Quantum Implementation of Parrondo's Paradox: We 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.<|reference_end|>
@article{miszczak2005quantum,
    title={Quantum Implementation of Parrondo's Paradox},
    author={J. A. Miszczak, P. Gawron},
    journal={Fluctuation and Noise Letters, Vol. 5, No. 4 (2005)},
    year={2005},
    doi={10.1142/S0219477505002902},
    archivePrefix={arXiv},
    eprint={quant-ph/0502185},
    primaryClass={quant-ph cs.GT}
}