2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/169159We 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, revtex4Quantum PhysicsComputer Science and Game Theorytext