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

Physical Review Research

Chaotic switching for quantum coin Parrondo's games with application to encryption

Joel Weijia Lai, Kang Hao Cheong

Published Jun 2, 2021• 24 citations
Publisher

Abstract

Quantum game theory has stimulated some interest in recent years with the advancement of quantum information theory.This interest has led to a resurgence of quantum Parrondo's games.With two losing games combining to give a winning game, this paradoxical idea is known as Parrondo's paradox.By using chaotic switching between the two losing quantum games, we show that it is possible to achieve Parrondo's paradox involving a quantum walker playing two-sided quantum coin tossing games.Furthermore, we show that the framework of chaotic switching in quantum coin tosses can be applied to encryption.This is a proposal to deploy a quantum coin toss with chaotic switching for semiclassical encryption.

DOI
10.1103/physrevresearch.3.l022019

Related papers

Implementing Parrondo’s paradox with two-coin quantum walks

Jishnu Rajendran, Colin Benjamin

Parrondo’s paradox is ubiquitous in games, ratchets and random walks. The apparent paradox, devised by J. M. R. Parrondo, that two losing gamesAandBcan produce a winning outcome has been adapted in many physical and biological systems to explain their working. However, proposals on demonstrating Parrondo’s paradox using quantum walks failed for a large number of steps. In this work, we show that instead of a single coin if we consider a two-coin initial state which may or may not be entangled, we can observe a genuine Parrondo’s paradox with quantum walks. Furthermore, we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which is necessary for observing a genuine Parrondo’s paradox. We extend our work to a three-coin initial state too with similar results. The implications of our work for observing quantum ratchet-like behaviour using quantum walks are also discussed.

arXiv:1702.05927•Royal Society Open Science•Feb 1, 2018•45 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

Parrondo Games and Quantum Algorithms

Chiu Fan Lee, Neil F. Johnson

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.

arXiv:quant-ph/0203043•Mar 10, 2002•22 citations

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 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 Bayesian networks with application to games displaying Parrondo's paradox

Michael Pejic

Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we will show is equivalent to standard textbook quantum mechanics. Therefore, this extension will be termed "quantum". However, the term "quantum" should not be taken to imply this extension is necessarily only of utility in situations traditionally thought of as in the domain of quantum mechanics. In principle, it may be employed in any modeling situation, say forecasting the weather or the stock market--it is up to experiment to determine if this extension is useful in practice. Even restricting to the domain of quantum mechanics, with this new formulation the advantages of Bayesian networks can be maintained for models incorporating quantum and mixed classical-quantum behavior. The use of these will be illustrated by various basic examples. Parrondo's paradox refers to the situation where two, multi-round games with a fixed winning criteria, both with probability greater than one-half for one player to win, are combined. Using a possibly biased coin to determine the rule to employ for each round, paradoxically, the previously losing player now wins the combined game with probability greater than one-half. Using the extended Bayesian networks, we will formulate and analyze classical observed, classical hidden, and quantum versions of a game that displays this paradox, finding bounds for the discrepancy from naive expectations for the occurrence of the paradox. A quantum paradox inspired by Parrondo's paradox will also be analyzed. We will prove a bound for the discrepancy from naive expectations for this paradox as well. Games involving quantum walks that achieve this bound will be presented.

arXiv:1503.08868•Mar 30, 2015•9 citations
Quantum game theory has stimulated some interest in recent years with the advancement of quantum information theory.This interest has led to a resurgence of quantum Parrondo's games.With two losing games combining to give a winning game, this paradoxical idea is known as Parrondo's paradox.By using chaotic switching between the two losing quantum games, we show that it is possible to achieve Parrondo's paradox involving a quantum walker playing two-sided quantum coin tossing games.Furthermore, we show that the framework of chaotic switching in quantum coin tosses can be applied to encryption.This is a proposal to deploy a quantum coin toss with chaotic switching for semiclassical encryption.
Parrondo’s paradox is ubiquitous in games, ratchets and random walks. The apparent paradox, devised by J. M. R. Parrondo, that two losing gamesAandBcan produce a winning outcome has been adapted in many physical and biological systems to explain their working. However, proposals on demonstrating Parrondo’s paradox using quantum walks failed for a large number of steps. In this work, we show that instead of a single coin if we consider a two-coin initial state which may or may not be entangled, we can observe a genuine Parrondo’s paradox with quantum walks. Furthermore, we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which is necessary for observing a genuine Parrondo’s paradox. We extend our work to a three-coin initial state too with similar results. The implications of our work for observing quantum ratchet-like behaviour using quantum walks are also discussed.
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.
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 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.
Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we will show is equivalent to standard textbook quantum mechanics. Therefore, this extension will be termed "quantum". However, the term "quantum" should not be taken to imply this extension is necessarily only of utility in situations traditionally thought of as in the domain of quantum mechanics. In principle, it may be employed in any modeling situation, say forecasting the weather or the stock market--it is up to experiment to determine if this extension is useful in practice. Even restricting to the domain of quantum mechanics, with this new formulation the advantages of Bayesian networks can be maintained for models incorporating quantum and mixed classical-quantum behavior. The use of these will be illustrated by various basic examples. Parrondo's paradox refers to the situation where two, multi-round games with a fixed winning criteria, both with probability greater than one-half for one player to win, are combined. Using a possibly biased coin to determine the rule to employ for each round, paradoxically, the previously losing player now wins the combined game with probability greater than one-half. Using the extended Bayesian networks, we will formulate and analyze classical observed, classical hidden, and quantum versions of a game that displays this paradox, finding bounds for the discrepancy from naive expectations for the occurrence of the paradox. A quantum paradox inspired by Parrondo's paradox will also be analyzed. We will prove a bound for the discrepancy from naive expectations for this paradox as well. Games involving quantum walks that achieve this bound will be presented.