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• 22 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

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

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•35 citations

Territories of Parrondo's paradox and its relation with entanglement in quantum walks

Munsif Jan, Khan, Niaz Ali, Gao Xianlong

Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones. In this paper, 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 different periods for distinct choices of the relative phase. Furthermore, we investigate the regimes of the relative phase of the initial state of coins where Parrondo games exist. Moreover, we also analyze the relationships between Parrondo's game and quantum entanglement and show regimes where the Parrondo sequence may generate a maximal entangler state in our scheme. Along with the applications of different kinds of quantum walks, our outcomes potentially encourage the development of new quantum algorithms.

arXiv:2006.16585•Jun 30, 2020•0 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

How to implement a genuine Parrondo's paradox with 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 games $A$ and $B$ can produce an 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 in the asymptotic limits. 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. Further we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which are necessary for observing a genuine Parrondo's paradox. We extend our work to a 3-coin initial state too with similar results. The implications of our work for observing quantum ratchet like behavior using quantum walks is also discussed.

•Feb 20, 2017•0 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
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.
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.
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.
Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones. In this paper, 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 different periods for distinct choices of the relative phase. Furthermore, we investigate the regimes of the relative phase of the initial state of coins where Parrondo games exist. Moreover, we also analyze the relationships between Parrondo's game and quantum entanglement and show regimes where the Parrondo sequence may generate a maximal entangler state in our scheme. Along with the applications of different kinds of quantum walks, our outcomes potentially encourage the development of new quantum algorithms.
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.
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J. M. R. Parrondo, that two losing games AAA and BBB can produce an 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 in the asymptotic limits. 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. Further we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which are necessary for observing a genuine Parrondo's paradox. We extend our work to a 3-coin initial state too with similar results. The implications of our work for observing quantum ratchet like behavior using quantum walks is also discussed.
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.