Quantum Implementation of Parrondo's Paradox

Abstract

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

References in corpus (5)

• Quantum Parrondo's Games
• Quantum random walks with history dependence
• Exploiting Randomness in Quantum Information Processing
• The next stage: quantum game theory
• Parrondo Games and Quantum Algorithms

Cited by in corpus (8)

• Parrondo's game using a discrete-time quantum walk
• Cooperative quantum Parrondo's games
• Optimal sequence for Parrondo games
• Genuine Parrondo's paradox in quantum walks with time-dependent coin operators
• Preferences in Quantum Games
• General model for a entanglement-enhanced composed quantum game on a two-dimensional lattice
• Parrondo's effect in continuous-time quantum walks
• Constructing games on networks for controlling the inequalities in the capital distribution