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:1007.1332 · PLoS ONE

Analysis of Two-Player Quantum Games in an EPR Setting Using Clifford's Geometric Algebra

James M. Chappell, Azhar Iqbal, Derek Abbott

Published Jan 18, 2012• 15 citations
arXivHTMLPDF

Abstract

The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of geometric algebra (GA). The main advantage of this framework is that the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, and hence the quantum game becomes a proper extension of the classical game, avoiding a criticism of other quantum game frameworks. We produce a general solution for two-player games, and as examples, we analyze the games of Prisoners' Dilemma and Stag Hunt in the EPR setting. The use of GA allows a quantum-mechanical analysis without the use of complex numbers or the Dirac Bra-ket notation, and hence is more accessible to the non-physicist.

DOI
10.1371/journal.pone.0029015

Related papers

Analyzing Three-Player Quantum Games in an EPR Type Setup

James M. Chappell, Azhar Iqbal, Derek Abbott

We use the formalism of Clifford Geometric Algebra (GA) to develop an analysis of quantum versions of three-player non-cooperative games. The quantum games we explore are played in an Einstein-Podolsky-Rosen (EPR) type setting. In this setting, the players' strategy sets remain identical to the ones in the mixed-strategy version of the classical game that is obtained as a proper subset of the corresponding quantum game. Using GA we investigate the outcome of a realization of the game by players sharing GHZ state, W state, and a mixture of GHZ and W states. As a specific example, we study the game of three-player Prisoners' Dilemma.

arXiv:1008.4689•PLoS ONE•Jul 27, 2011•20 citations

N-Player Quantum Games in an EPR Setting

James M. Chappell, Azhar Iqbal, Derek Abbott

The N-player quantum games are analyzed that use an Einstein-Podolsky-Rosen (EPR) experiment, as the underlying physical setup. In this setup, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for N-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the players' payoffs and mixed Nash equilibrium are determined. Players' N x N payoff matrices are then defined using linear functions so that common two-player games can be easily extended to the N-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general N ≥ 2. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs. By dispensing with the standard unitary transformations on state vectors in Hilbert space and using instead rotors and multivectors, based on Clifford's geometric algebra (GA), it is shown how the N-player case becomes tractable. The new mathematical approach presented here has wide implications in the areas of quantum information and quantum complexity, as it opens up a powerful way to tractably analyze N-partite qubit interactions.

arXiv:1202.5111•PLoS ONE•May 11, 2012•23 citations

Investigations in quantum games using EPR-type set-ups

Azhar Iqbal

Research in quantum games has flourished during recent years. However, it seems that opinion remains divided about their true quantum character and content. For example, one argument says that quantum games are nothing but 'disguised' classical games and that to quantize a game is equivalent to replacing the original game by a different classical game. The present thesis contributes towards the ongoing debate about quantum nature of quantum games by developing two approaches addressing the related issues. Both approaches take Einstein-Podolsky-Rosen (EPR)-type experiments as the underlying physical set-ups to play two-player quantum games. In the first approach, the players' strategies are unit vectors in their respective planes, with the knowledge of coordinate axes being shared between them. Players perform measurements in an EPR-type setting and their payoffs are defined as functions of the correlations, i.e. without reference to classical or quantum mechanics. Classical bimatrix games are reproduced if the input states are classical and perfectly anti-correlated, as for a classical correlation game. However, for a quantum correlation game, with an entangled singlet state as input, qualitatively different solutions are obtained. The second approach uses the result that when the predictions of a Local Hidden Variable (LHV) model are made to violate the Bell inequalities the result is that some probability measures assume negative values. With the requirement that classical games result when the predictions of a LHV model do not violate the Bell inequalities, our analysis looks at the impact which the emergence of negative probabilities has on the solutions of two-player games which are physically implemented using the EPR-type experiments.

arXiv:quant-ph/0604188•Apr 25, 2006•1 citation

Complex Clifford algebra in repeated quantum prisoner's dilemma

Ivan Eryganov, Jaroslav Hrdina

This paper introduces an application of complex Clifford algebra in a representation of the quantum prisoner's dilemma. The authors propose a novel modification of the Eisert–Lewenstein–Wilkens protocol to represent a repeated version of the quantum game. This repeated modification allows to embed entanglement into players' strategy sets and to see how players will operate with it. The apparatus of complex Clifford algebra enables an intuitive representation of the suggested protocol and efficient computation of the resulting payoff functions. The presented findings provide a new point of view on the interpretation of entanglement as a measure of information transition between rounds of the game.

Mathematical Methods in the Applied Sciences•Sep 6, 2022•3 citations

Constructing quantum games from nonfactorizable joint probabilities

Azhar Iqbal, Taksu Cheon

A probabilistic framework is developed that gives a unifying perspective on both the classical and quantum versions of two-player games. We suggest exploiting peculiar joint probabilities involved in Einstein-Podolsky-Rosen (EPR) experiments to construct a quantum game when the corresponding classical game is obtained from factorizable joint probabilities. We analyze how nonfactorizability changes Nash equilibria in three well-known games of prisoner's dilemma, stag hunt, and chicken. In this framework we find that for the game of prisoner's dilemma even nonfactorizable EPR joint probabilities cannot be helpful to escape from the classical outcome of the game. For a particular version of the chicken game, however, we find that the two nonfactorizable sets of joint probabilities, which maximally violate the Clauser-Holt-Shimony-Horne sum of correlations, indeed result in new Nash equilibria.

arXiv:0707.2868•Physical Review E•Dec 20, 2007•35 citations

Quantum correlation games

Azhar Iqbal, Stefan Weigert

A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of correlations , i.e. without reference to classical or quantum mechanics. Classical bi-matrix games are reproduced if the input states are classical and perfectly anti-correlated, that is, for a classical correlation game. However, for a quantum correlation game, with an entangled singlet state as input, qualitatively different solutions are obtained. For example, the Prisoners' Dilemma acquires a Nash equilibrium if both players apply a mixed strategy. It appears to be conceptually impossible to reproduce the properties of quantum correlation games within the framework of classical games.

arXiv:quant-ph/0306176•Journal of Physics A Mathematical and General•May 19, 2004•34 citations
The framework for playing quantum games in an Einstein-Podolsky-Rosen (EPR) type setting is investigated using the mathematical formalism of geometric algebra (GA). The main advantage of this framework is that the players' strategy sets remain identical to the ones in the classical mixed-strategy version of the game, and hence the quantum game becomes a proper extension of the classical game, avoiding a criticism of other quantum game frameworks. We produce a general solution for two-player games, and as examples, we analyze the games of Prisoners' Dilemma and Stag Hunt in the EPR setting. The use of GA allows a quantum-mechanical analysis without the use of complex numbers or the Dirac Bra-ket notation, and hence is more accessible to the non-physicist.
We use the formalism of Clifford Geometric Algebra (GA) to develop an analysis of quantum versions of three-player non-cooperative games. The quantum games we explore are played in an Einstein-Podolsky-Rosen (EPR) type setting. In this setting, the players' strategy sets remain identical to the ones in the mixed-strategy version of the classical game that is obtained as a proper subset of the corresponding quantum game. Using GA we investigate the outcome of a realization of the game by players sharing GHZ state, W state, and a mixture of GHZ and W states. As a specific example, we study the game of three-player Prisoners' Dilemma.
The N-player quantum games are analyzed that use an Einstein-Podolsky-Rosen (EPR) experiment, as the underlying physical setup. In this setup, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players' strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for N-qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the players' payoffs and mixed Nash equilibrium are determined. Players' N x N payoff matrices are then defined using linear functions so that common two-player games can be easily extended to the N-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners' Dilemma game for general N ≥ 2. We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs. By dispensing with the standard unitary transformations on state vectors in Hilbert space and using instead rotors and multivectors, based on Clifford's geometric algebra (GA), it is shown how the N-player case becomes tractable. The new mathematical approach presented here has wide implications in the areas of quantum information and quantum complexity, as it opens up a powerful way to tractably analyze N-partite qubit interactions.
Research in quantum games has flourished during recent years. However, it seems that opinion remains divided about their true quantum character and content. For example, one argument says that quantum games are nothing but 'disguised' classical games and that to quantize a game is equivalent to replacing the original game by a different classical game. The present thesis contributes towards the ongoing debate about quantum nature of quantum games by developing two approaches addressing the related issues. Both approaches take Einstein-Podolsky-Rosen (EPR)-type experiments as the underlying physical set-ups to play two-player quantum games. In the first approach, the players' strategies are unit vectors in their respective planes, with the knowledge of coordinate axes being shared between them. Players perform measurements in an EPR-type setting and their payoffs are defined as functions of the correlations, i.e. without reference to classical or quantum mechanics. Classical bimatrix games are reproduced if the input states are classical and perfectly anti-correlated, as for a classical correlation game. However, for a quantum correlation game, with an entangled singlet state as input, qualitatively different solutions are obtained. The second approach uses the result that when the predictions of a Local Hidden Variable (LHV) model are made to violate the Bell inequalities the result is that some probability measures assume negative values. With the requirement that classical games result when the predictions of a LHV model do not violate the Bell inequalities, our analysis looks at the impact which the emergence of negative probabilities has on the solutions of two-player games which are physically implemented using the EPR-type experiments.
This paper introduces an application of complex Clifford algebra in a representation of the quantum prisoner's dilemma. The authors propose a novel modification of the Eisert–Lewenstein–Wilkens protocol to represent a repeated version of the quantum game. This repeated modification allows to embed entanglement into players' strategy sets and to see how players will operate with it. The apparatus of complex Clifford algebra enables an intuitive representation of the suggested protocol and efficient computation of the resulting payoff functions. The presented findings provide a new point of view on the interpretation of entanglement as a measure of information transition between rounds of the game.
A probabilistic framework is developed that gives a unifying perspective on both the classical and quantum versions of two-player games. We suggest exploiting peculiar joint probabilities involved in Einstein-Podolsky-Rosen (EPR) experiments to construct a quantum game when the corresponding classical game is obtained from factorizable joint probabilities. We analyze how nonfactorizability changes Nash equilibria in three well-known games of prisoner's dilemma, stag hunt, and chicken. In this framework we find that for the game of prisoner's dilemma even nonfactorizable EPR joint probabilities cannot be helpful to escape from the classical outcome of the game. For a particular version of the chicken game, however, we find that the two nonfactorizable sets of joint probabilities, which maximally violate the Clauser-Holt-Shimony-Horne sum of correlations, indeed result in new Nash equilibria.
A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of correlations , i.e. without reference to classical or quantum mechanics. Classical bi-matrix games are reproduced if the input states are classical and perfectly anti-correlated, that is, for a classical correlation game. However, for a quantum correlation game, with an entangled singlet state as input, qualitatively different solutions are obtained. For example, the Prisoners' Dilemma acquires a Nash equilibrium if both players apply a mixed strategy. It appears to be conceptually impossible to reproduce the properties of quantum correlation games within the framework of classical games.