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:1005.5262 · Physics Letters A

Constructing quantum games from symmetric non-factorizable joint probabilities

James M. Chappell, Azhar Iqbal, Derek Abbott

Published Aug 15, 2010• 15 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2010.08.024

Related papers

Non-factorizable joint probabilities and evolutionarily stable strategies in the quantum prisoner's dilemma game

Azhar Iqbal, Derek Abbott

arXiv:0902.2889•Physics Letters A•May 16, 2009•14 citations

Constructing quantum games from a system of Bell's inequalities

Azhar Iqbal, Derek Abbott

arXiv:0909.3369•Physics Letters A•May 26, 2010•26 citations

Constructing multi-player quantum games from non-factorizable joint probabilities

Azhar Iqbal, Taksu Cheon

We use the standard three-party Einstein-Podolsky-Rosen (EPR) setting in order to play general three-player non-cooperative symmetric games. We analyze how the peculiar non-factorizable joint probabilities that may emerge in the EPR setting can change outcome of the game. Our setup requires that the quantum game attains classical interpretation for factor- izable joint probabilities. We analyze the generalized three-player game of Prisoner's Dilemma (PD) and show that the players can indeed escape from the classical outcome of the game because of non-factorizable joint probabilities. This result for three-player PD contrasts strikingly with our earlier result for two-player PD for which even non-factorizable joint prob- abilities are not found to be helpful to escape from the classical outcome of the game.

arXiv:0712.3701•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 21, 2007•7 citations

An Invitation to Quantum Game Theory

Edward W. Piotrowski, Jan Sładkowski

arXiv:quant-ph/0211191•International Journal of Theoretical Physics•May 1, 2003•195 citations

Joint Probabilities Approach to Quantum Games with Noise

Alexis R. Legón, Ernesto A. Medina

A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not generically destroy entanglement. This formalism was applied to the Prisoner's Dilemma, the Chicken Game, and the Battle of the Sexes, where noise is coupled through a single parameter μ. We find that for all the games except for the Battle of the Sexes, the Nash inequalities are maintained up to a threshold value of the noise. Beyond the threshold value, the inequalities no longer hold for quantum and classical strategies. For the Battle of the sexes, the Nash inequalities always hold, no matter the noise strength. This is due to the symmetry and anti-symmetry of the parameters that determine the joint probabilities for that game. Finally, we propose a new correlation measure for the games with classical and quantum strategies, where we obtain that the incorporation of noise, when we have quantum strategies, does not affect entanglement, but classical strategies result in behavior that approximates quantum games with quantum strategies without the need to saturate the system with the maximum value of noise. In this manner, these correlations can be understood as entanglement for our game approach.

Entropy•Aug 16, 2023•7 citations

Quantum games and games with factorizable and non-factorizable probabilities

Azhar Iqbal, James M. Chappell, Derek Abbott

A quantum game-theoretic setting enables the analysis of strategic interaction among agents with access to quantum resources. One of the original motivations for re-expressing quantum algorithms, and quantum communication protocols, in terms of competing quantum agents was to provide new insights into their workings. Looking closely, one finds that quantum strategic interactions utilize quantum probabilities and such probabilities are realizable in quantum mechanical experiments that allow implementation of unitary transformations, quantum measurements etc. This paper presents a perspective on a quantum game-theoretic framework involving quantum probabilities, which are not subject to the strong factorizability constraints that classical probabilities are found to possess. We suggest that a quantum version of a classical game can be obtained more directly if we replace the factorizability relations for probabilities in a classical game with two weaker constraints that are also obeyed by the quantum probabilities. The solutions of symmetric bimatrix games with such `non-factorizable' probabilities are then analyzed and compared to the solutions that appear in the standard version of a quantum game.

•Sep 17, 2014•1 citation
We use the standard three-party Einstein-Podolsky-Rosen (EPR) setting in order to play general three-player non-cooperative symmetric games. We analyze how the peculiar non-factorizable joint probabilities that may emerge in the EPR setting can change outcome of the game. Our setup requires that the quantum game attains classical interpretation for factor- izable joint probabilities. We analyze the generalized three-player game of Prisoner's Dilemma (PD) and show that the players can indeed escape from the classical outcome of the game because of non-factorizable joint probabilities. This result for three-player PD contrasts strikingly with our earlier result for two-player PD for which even non-factorizable joint prob- abilities are not found to be helpful to escape from the classical outcome of the game.
A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not generically destroy entanglement. This formalism was applied to the Prisoner's Dilemma, the Chicken Game, and the Battle of the Sexes, where noise is coupled through a single parameter μ. We find that for all the games except for the Battle of the Sexes, the Nash inequalities are maintained up to a threshold value of the noise. Beyond the threshold value, the inequalities no longer hold for quantum and classical strategies. For the Battle of the sexes, the Nash inequalities always hold, no matter the noise strength. This is due to the symmetry and anti-symmetry of the parameters that determine the joint probabilities for that game. Finally, we propose a new correlation measure for the games with classical and quantum strategies, where we obtain that the incorporation of noise, when we have quantum strategies, does not affect entanglement, but classical strategies result in behavior that approximates quantum games with quantum strategies without the need to saturate the system with the maximum value of noise. In this manner, these correlations can be understood as entanglement for our game approach.
A quantum game-theoretic setting enables the analysis of strategic interaction among agents with access to quantum resources. One of the original motivations for re-expressing quantum algorithms, and quantum communication protocols, in terms of competing quantum agents was to provide new insights into their workings. Looking closely, one finds that quantum strategic interactions utilize quantum probabilities and such probabilities are realizable in quantum mechanical experiments that allow implementation of unitary transformations, quantum measurements etc. This paper presents a perspective on a quantum game-theoretic framework involving quantum probabilities, which are not subject to the strong factorizability constraints that classical probabilities are found to possess. We suggest that a quantum version of a classical game can be obtained more directly if we replace the factorizability relations for probabilities in a classical game with two weaker constraints that are also obeyed by the quantum probabilities. The solutions of symmetric bimatrix games with such `non-factorizable' probabilities are then analyzed and compared to the solutions that appear in the standard version of a quantum game.