Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1008.5121 · Physics Letters A

Parrondoʼs game using a discrete-time quantum walk

C. M. Chandrashekar, Subhashish Banerjee

Published Mar 5, 2011• 39 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2011.02.071

Related papers

Parrondo’s game of quantum search based on quantum walk

Taisuke Hosaka, Norio Konno

arXiv:2303.06579•Quantum Information Processing•Jun 24, 2024•3 citations

A Quantum Analogue of Parrondo's Game

Clement Boateng Ampadu

We consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed.

arXiv:1104.5275•Apr 28, 2011•1 citation

QUANTUM PARRONDO'S GAMES CONSTRUCTED BY QUANTUM RANDOM WALKS

Min Li, Yong-Sheng Zhang, Guang‐Can Guo

We construct a Parrondo's game using discrete-time quantum walks (DTQWs). Two losing games are represented by two different coin operators. By mixing the two coin operators UA(αA, βA, γA) and UB(αB, βB, γB), we may win the game. Here, we mix the two games in position instead of time. With a number of selections of the parameters, we can win the game with sequences ABB, ABBB, etc. If we set βA = 45°, γA = 0, αB = 0, βB = 88°, we find game 1 with [Formula: see text], [Formula: see text] will win and get the most profit. If we set αA = 0, βA = 45°, αB = 0, βB = 88° and game 2 with [Formula: see text], [Formula: see text] will win most. Game 1 is equivalent to game 2 with changes in sequences and steps. But at large enough steps, the game will lose at last. Parrondo's paradox does not exist in classical situation with our model.

arXiv:1303.6831•Fluctuation and Noise Letters•Oct 22, 2013•20 citations

Quantum models of Parrondo's games

Adrian P. Flitney, Derek Abbott

Physica A Statistical Mechanics and its Applications•May 1, 2003•57 citations

Native quantum games from interacting discrete-time quantum walks

Rashid Ahmad

We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by distinguishable quantum walkers, strategies correspond to local coin operations, and payoffs are defined as expectation values of physical observables. Using interacting discrete-time quantum walks as a concrete platform, we demonstrate numerically that competitive, cooperative, and asymmetric games admit stable stationary strategy profiles when the walkers are coupled, while no non-trivial equilibria exist in the absence of interaction. To clarify the game-theoretic structure, we derive an analytic perturbative decomposition of the payoff function in the weak-interaction regime, showing explicitly that strategic coupling originates from interaction-induced interference terms in the joint probability distribution. For a collision-based phase interaction, the payoff becomes non-separable at first order in the interaction strength and generically admits stationary points satisfying the Nash conditions. Our results provide a physically explicit realization of strategic interdependence in quantum transport processes and establish interacting quantum walks as a minimal platform for studying game-theoretic behavior emerging from unitary dynamics.

quant-pharXiv:2604.20455•Quantum Information Processing•Apr 23, 2026•2 citations

Quantum Parrondo’s Games Under Decoherence

Salman Khan, M. Ramzan, M. K. Khan

arXiv:0909.2897•International Journal of Theoretical Physics•Nov 3, 2009•21 citations
We construct a Parrondo's game using discrete-time quantum walks (DTQWs). Two losing games are represented by two different coin operators. By mixing the two coin operators UA(αA, βA, γA) and UB(αB, βB, γB), we may win the game. Here, we mix the two games in position instead of time. With a number of selections of the parameters, we can win the game with sequences ABB, ABBB, etc. If we set βA = 45°, γA = 0, αB = 0, βB = 88°, we find game 1 with [Formula: see text], [Formula: see text] will win and get the most profit. If we set αA = 0, βA = 45°, αB = 0, βB = 88° and game 2 with [Formula: see text], [Formula: see text] will win most. Game 1 is equivalent to game 2 with changes in sequences and steps. But at large enough steps, the game will lose at last. Parrondo's paradox does not exist in classical situation with our model.
We study how strategic interaction can arise from controlled quantum dynamics rather than being imposed as an external mathematical structure. We introduce a class of interaction-defined quantum games in which players are represented by distinguishable quantum walkers, strategies correspond to local coin operations, and payoffs are defined as expectation values of physical observables. Using interacting discrete-time quantum walks as a concrete platform, we demonstrate numerically that competitive, cooperative, and asymmetric games admit stable stationary strategy profiles when the walkers are coupled, while no non-trivial equilibria exist in the absence of interaction. To clarify the game-theoretic structure, we derive an analytic perturbative decomposition of the payoff function in the weak-interaction regime, showing explicitly that strategic coupling originates from interaction-induced interference terms in the joint probability distribution. For a collision-based phase interaction, the payoff becomes non-separable at first order in the interaction strength and generically admits stationary points satisfying the Nash conditions. Our results provide a physically explicit realization of strategic interdependence in quantum transport processes and establish interacting quantum walks as a minimal platform for studying game-theoretic behavior emerging from unitary dynamics.