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:1503.08868

Quantum Bayesian networks with application to games displaying Parrondo's paradox

Michael Pejic

Published Mar 30, 2015• 9 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1503.08868

Related papers

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

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

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

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

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
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.
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.
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.
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.
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 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.