Quantum Implementation of Parrondo's Paradox
Abstract
Description
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.
6 figures, revtex4
6 figures, revtex4