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

Procedia Engineering

The Quantum Game Interpretation for a Special Phenomenon of Parrondo's Paradox

Rui Li, Yong-fei Zhu, Jia-yi Guo, Lu Wang, Nenggang Xie

Published Jan 1, 2011• 6 citations
Publisher

Abstract

Here we contract two associated games that consist of tossing biased coins. By using the discrete-time Markov chain method, game AB, which is played in alternation, is studied by means of theoretical analysis and computer simulation. And we find that this game didn’t have a definite stationary probability distribution and that payoffs of the game depended on the parity of the initial capital. Besides, the quantization method is used in a further study. The results show that the explanation of the game corresponding to a stationary probability distribution is that the probability of the initial capital has reached parity.

DOI
10.1016/j.proeng.2011.08.696

Related papers

Parrondo effect in quantum coin-toss simulations

Joel Weijia Lai, Kang Hao Cheong

Game A + Game B = Game C. Parrondo's games follow this basic structure where A and B are losing games and C is a winning game-a phenomenon called Parrondo's paradox. These games can take on a wider class of definitions and exhibit these paradoxical results. In this paper, we show three paradoxical cases. (i) The successive "tossing" of a single fair quantum coin gives a biased result, a previously known result. (ii) The random tossing of two quantum coins, each with successive biased expectations, gives an average random walk position of approximately zero. (iii) The sequential periodic tossing of two quantum coins, each with successive negative biased expectations, gives an average random walk with positive expectation. Using these results, we then propose a protocol for identifying and classifying quantum operations that span the same Hilbert space for a two-level quantum system.

Physical review. E•May 18, 2020•36 citations

Study of Parrondo's paradox regions in one-dimensional quantum walks

Munsif Jan, Xiao-Ye Xu, Wang Qin Qin +4 more

The well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones, is called Parrondo's paradox. Here, we study one-dimensional discrete-time quantum walks, manipulating two different coins (two-state) operators representing two losing games A and B, respectively, to create the Parrondo effect in the quantum domain. We exhibit that games A and B are losing games when played individually but could produce a winning expectation when played alternatively for a particular sequence of the different periods. Moreover, we also analyze the relationships between Parrondo's games and quantum entanglement in our scheme. Along with the applications of different kinds of quantum walks, our outcomes potentially encourage the development of new quantum algorithms.

•Jun 30, 2020•2 citations

Scouring Parrondo's paradox in discrete-time quantum walks

Gururaj Kadiri

We propose a quantum game based on coin-based quantum walks. Given a quantum walk and a Hermitian operator on the coin-position composite space, winning this game involves choosing an initial coin state such that the given quantum walk leads to a composite state in which the expectation value of the given Hermitian operator is greater than a certain value. Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy. We give a deterministic scheme for identifying Parrondo's paradox in our game, in the sense that, given a collection of distinct quantum steps, we identify initial coin states which happen to be losing states for all quantum walks comprised solely of these steps individually, but turn out to be winning states for a quantum walk comprised of all the given steps taken in a sequence. Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin toss, the steps of the quantum walks employed here, though still contingent upon coin toss, permit the strides to be of unequal magnitude, and not necessarily in opposite directions. We believe the results presented here will contribute to a deeper understanding of evolution of expectation values of observables in quantum walks, and facilitate the development of novel quantum algorithms.

arXiv:2401.08983•Physical Review A•Aug 14, 2024•4 citations

Parrondo paradoxical walk using four-sided quantum coins

Joel Weijia Lai, Jean Ren Adriel Tan, Huiyi Lu +2 more

Two losing games can be played in a certain manner to produce a winning outcome-a phenomenon known as Parrondo's paradox. Of particular interest is the emergence of quantum game theory and the attempt to model known Parrondo's games through quantum computation notation. In this article, we investigate whether flipping four-sided quantum coins will result in the emergence of Parrondo's paradox. We discover that by playing two losing games A and B in a sequential order, a winning scenario can be derived. Furthermore, four-sided quantum coin is the first instance where the ratcheting effect from the classical Parrondo's game is necessary. Crucially, our study is designed with quantum protocols as its basis and does not have a direct classical counterpart.

Physical review. E•Jul 17, 2020•17 citations

Quantum Parrondo's games using quantum walks

Adrian P. Flitney

We study a quantum walk in one-dimension using two different "coin" operators. By mixing two operators, both of which give a biased walk with negative expectation value for the walker position, it is possible to reverse the bias through interference effects. This effect is analogous to that in Parrondo's games, where alternating two losing (gambling) games can produce a winning game. The walker bias is produced by introducing a phase factor into the coin operator, with two different phase factors giving games $A$ and $B$. We give the range of phases for which the Parrondo effect can be obtained with $A$ and $B$ played alternately or in other (repeated) deterministic sequences. The effect is transitory. For sufficiently large times the original bias resumes.

arXiv:1209.2252•Sep 11, 2012•22 citations

Quantum models of Parrondo's games

Adrian P. Flitney, Derek Abbott

It is possible to have two games that are losing when played in isolation but that, because of some form of feedback, produce a winning game when played alternately or even in a random mixture. This effect is known as Parrondo's paradox. Quantum mechanics provides novel methods of combining two games through interference and entanglement. Two models of quantum Parrondo's games have been published and these are reviewed here. We speculate on a model of a quantum Parrondo's game using entanglement. Such games could find a use in the development of algorithms for quantum computers.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 1, 2002•0 citations
Here we contract two associated games that consist of tossing biased coins. By using the discrete-time Markov chain method, game AB, which is played in alternation, is studied by means of theoretical analysis and computer simulation. And we find that this game didn’t have a definite stationary probability distribution and that payoffs of the game depended on the parity of the initial capital. Besides, the quantization method is used in a further study. The results show that the explanation of the game corresponding to a stationary probability distribution is that the probability of the initial capital has reached parity.
Game A + Game B = Game C. Parrondo's games follow this basic structure where A and B are losing games and C is a winning game-a phenomenon called Parrondo's paradox. These games can take on a wider class of definitions and exhibit these paradoxical results. In this paper, we show three paradoxical cases. (i) The successive "tossing" of a single fair quantum coin gives a biased result, a previously known result. (ii) The random tossing of two quantum coins, each with successive biased expectations, gives an average random walk position of approximately zero. (iii) The sequential periodic tossing of two quantum coins, each with successive negative biased expectations, gives an average random walk with positive expectation. Using these results, we then propose a protocol for identifying and classifying quantum operations that span the same Hilbert space for a two-level quantum system.
The well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones, is called Parrondo's paradox. Here, we study one-dimensional discrete-time quantum walks, manipulating two different coins (two-state) operators representing two losing games A and B, respectively, to create the Parrondo effect in the quantum domain. We exhibit that games A and B are losing games when played individually but could produce a winning expectation when played alternatively for a particular sequence of the different periods. Moreover, we also analyze the relationships between Parrondo's games and quantum entanglement in our scheme. Along with the applications of different kinds of quantum walks, our outcomes potentially encourage the development of new quantum algorithms.
We propose a quantum game based on coin-based quantum walks. Given a quantum walk and a Hermitian operator on the coin-position composite space, winning this game involves choosing an initial coin state such that the given quantum walk leads to a composite state in which the expectation value of the given Hermitian operator is greater than a certain value. Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy. We give a deterministic scheme for identifying Parrondo's paradox in our game, in the sense that, given a collection of distinct quantum steps, we identify initial coin states which happen to be losing states for all quantum walks comprised solely of these steps individually, but turn out to be winning states for a quantum walk comprised of all the given steps taken in a sequence. Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin toss, the steps of the quantum walks employed here, though still contingent upon coin toss, permit the strides to be of unequal magnitude, and not necessarily in opposite directions. We believe the results presented here will contribute to a deeper understanding of evolution of expectation values of observables in quantum walks, and facilitate the development of novel quantum algorithms.
Two losing games can be played in a certain manner to produce a winning outcome-a phenomenon known as Parrondo's paradox. Of particular interest is the emergence of quantum game theory and the attempt to model known Parrondo's games through quantum computation notation. In this article, we investigate whether flipping four-sided quantum coins will result in the emergence of Parrondo's paradox. We discover that by playing two losing games A and B in a sequential order, a winning scenario can be derived. Furthermore, four-sided quantum coin is the first instance where the ratcheting effect from the classical Parrondo's game is necessary. Crucially, our study is designed with quantum protocols as its basis and does not have a direct classical counterpart.
We study a quantum walk in one-dimension using two different "coin" operators. By mixing two operators, both of which give a biased walk with negative expectation value for the walker position, it is possible to reverse the bias through interference effects. This effect is analogous to that in Parrondo's games, where alternating two losing (gambling) games can produce a winning game. The walker bias is produced by introducing a phase factor into the coin operator, with two different phase factors giving games AAA and BBB. We give the range of phases for which the Parrondo effect can be obtained with AAA and BBB played alternately or in other (repeated) deterministic sequences. The effect is transitory. For sufficiently large times the original bias resumes.
It is possible to have two games that are losing when played in isolation but that, because of some form of feedback, produce a winning game when played alternately or even in a random mixture. This effect is known as Parrondo's paradox. Quantum mechanics provides novel methods of combining two games through interference and entanglement. Two models of quantum Parrondo's games have been published and these are reviewed here. We speculate on a model of a quantum Parrondo's game using entanglement. Such games could find a use in the development of algorithms for quantum computers.