Skip to main content
PLOS One logoLink to PLOS One
. 2012 Jan 18;7(1):e29015. doi: 10.1371/journal.pone.0029015

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

James M Chappell 1,2,*, Azhar Iqbal 2, Derek Abbott 2
Editor: Gerardo Adesso3
PMCID: PMC3261139  PMID: 22279525

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.

Introduction

Although its origins can be traced to earlier works [1][4], the extension of game theory [5], [6] to the quantum regime [7] was proposed by Meyer [8] and Eisert et al [9] and has since been investigated by others [10][48]. Game theory is a vast subject but many interesting strategic interactions can still be found in simple-to-analyze two-player two-strategy non-cooperative games. The well known games of Prisoners' Dilemma (PD) and Stag Hunt [5], [6] are two such examples.

The general idea in the quantization scheme proposed by Eisert et al [9] for such games involves a referee who forwards a two-qubit entangled state to the two players. Players perform their strategic actions on the state that consist of local unitary transformations to their respective qubits. The qubits are subsequently returned to the referee for measurement from which the players' payoffs are determined. The setup ensures that players sharing a product initial state corresponds to the mixed-strategy version of the considered classical game. However, players sharing an entangled state can lead to new Nash equilibria (NE) [5], [6] consisting of pairs of unitary transformations [7], [9]. At these quantum NE the players can have higher payoffs relative to what they obtain at the NE in the mixed-strategy version of the classical game.

This approach to constructing quantum games was subsequently criticized [12] as follows. The players' strategic actions in the quantum game are extended operations relative to their actions in the original mixed-strategy version of the classical game, in which, each player can perform a strategic action consisting of a probabilistic combination of their two pure strategies. The mentioned criticism [12] argued that as the quantum players have expanded strategy sets and can do more than what the classical players can do, it is plausible to represent the quantum game as an extended classical game that also involves new pure strategies. The entries in the extended game matrix can then be suitably chosen so to be representative of the players' payoffs at the obtained quantum NE. This line of reasoning can be extended further in stating that quantum games are in fact ‘disguised’ classical games and to quantize a game is equivalent to replacing the original game by an extended classical game.

As a way to counter the criticism in [12], two-party Einstein-Podolsky-Rosen (EPR) type experiments [49][56] are recognized to have genuinely quantum features. One observes that the setting of such experiments can be fruitfully adapted [25], [28], [34], [42], [45] for playing a quantum version of a two-player two-strategy game, which allows us to avoid the criticism from another perspective. In particular, with the EPR type setting the players' strategies can be defined entirely classically–consisting of a probabilistic combination of a player's choice between two measurement directions. That is, with this setting, the players' strategy sets remain identical to ones they have in a standard arrangement for playing a mixed-strategy version of a classical two-player two-strategy game. As the players' strategy sets in the quantum game are not extended relative to the classical game, for this route to constructing quantum games, the mentioned criticism [12] does not apply. A diagram comparing quantum games in an EPR setting with a conventional quantum game setup is shown in Fig. 1.

Figure 1. The EPR setting for playing quantum games compared with the conventional scheme.

Figure 1

In the conventional scheme two qubits are entangled using an entangling operator Inline graphic, after which each player applies a unitary transformation Inline graphic,Inline graphic on their respective qubits. The supervisor then applies the inverse entangling operation (some researchers omit this operation) followed by measurement with Stern-Gerlach detectors. The EPR scheme, on the other hand, while it creates a general entangled state, each player is simply presented with a classical choice between two possible measurement directions for their Stern-Gerlach detector, as represented by the two arrows, so that the players strategy sets remain classical.

The usefulness of applying the formalism of geometric algebra (GA) [57][63] in the investigation of quantum games has recently been shown [46] for the well known quantum penny flip game [8]. One may ask about the need of using the formalism of GA when, for instance, the GA based analysis of two-player quantum games developed in the following can also be reproduced with the standard analysis with Pauli matrices. We argue that the Pauli matrices are not always the preferred representation. Especially, as it is quite often overlooked that the algebra of Pauli matrices is the matrix representation for the Clifford's geometric algebra Inline graphic, which is no more and no less than a system of directed numbers representing the geometrical properties of Euclidean Inline graphic-space. As a GA based analysis allows using operations in Inline graphic-space with real coordinates, it thus permits a visualization that is simply not available in the standard approach using matrices over the field of complex numbers. Pauli matrices are isomorphic to the quaternions, and hence represent rotations of particle states. This fact paves the way to describe general unitary transformations on qubits, in a simplified algebraic form, as rotors that bring noticeable simplifications and geometrical clarifications. We apply constraints on the parameters of EPR type arrangements that ensure a faithful embedding of the mixed-strategy version of the original classical game within the corresponding quantum game. In particular, we show how using GA we can determine new NE in quantum games of Stag Hunt and Prisoners' Dilemma played in the EPR type setting.

EPR setting for playing a quantum game

We have the following payoff matrices

graphic file with name pone.0029015.e007.jpg (1)

giving Alice's and Bob's payoffs, respectively. Here Alice's pure strategies are Inline graphic and Inline graphic and Bob's pure strategies are Inline graphic and Inline graphic. In a run, Alice chooses her strategy to be either Inline graphic or Inline graphic and likewise, in the same run, Bob chooses his strategy to be either Inline graphic or Inline graphic. We consider games with symmetrical payoffs for which Inline graphic, where Inline graphic indicates transpose. This requires Inline graphic Inline graphic Inline graphic and Inline graphic

The EPR setting assumes that players Alice and Bob are spatially-separated participants, who are located at the two arms of the EPR system. In a run, each player receives one half of a two-particle system emitted by the same source. We associate Alice's strategies Inline graphic to the directions Inline graphic respectively and similarly, associate Bob's strategies Inline graphic to the directions Inline graphic, respectively. On receiving a pair of particles, players Alice and Bob together choose a pair of directions from the four possible cases Inline graphic Inline graphic Inline graphic Inline graphic and a quantum measurement is performed along the chosen pair. The outcome of the measurement at either arm is Inline graphic or Inline graphic. Over a large number of runs, a record is maintained of the players' choices of directions, representing their strategies, and one of the four possible outcomes Inline graphic Inline graphic Inline graphic Inline graphic emerging out of the measurement. Within each of the brackets, the first entry is reserved for the outcome at Alice's side and the second entry for the outcome at Bob's side. Players' payoff relations are expressed in terms of the outcomes of measurements that are recorded for a large number of runs, as the players sequentially receive, two-particle systems emitted from the source. These payoffs depend on the strategic choices that each player adapts for his/her two directions over many runs, and on the dichotomic outcomes of the measurements performed along those directions. We specify that player payoffs are to be determined over a larger number of runs, because in this setup the directions of measurements are defined as players' strategies and for one set of directions (strategies) the measurement returns one of the four possible probabilistic outcomes Inline graphic, and Inline graphic In classical game theory a given pair of players' strategies uniquely determines the payoff for each player but a single run in an EPR experiment cannot uniquely determine players' payoffs as for the same strategies (directions) their is still a probabilistic outcome arising from the nature of the measurement of quantum states.

Geometric algebra

Geometric algebra (GA) [57][61] is an associative non-commutative algebra, that can provide an equivalent description to the conventional Dirac bra-ket and matrix formalisms of quantum mechanics, consisting of solely of algebraic elements over a strictly real field. Recently, Christian [64], [65] has used the formalism of GA in thought provoking investigations of some of the foundational questions in quantum mechanics. In the area of quantum games, GA has been used by Chappell et al [46] to determine all possible unitary transformations that implement a winning strategy in Meyer's PQ penny flip quantum game [8], and also in analyzing three-player quantum games [48].

Given a linear vector space Inline graphic with elements Inline graphic we may form [66] the tensor product Inline graphic of vector spaces Inline graphic, containing elements (bivectors) Inline graphic and hence construct the exterior or wedge product Inline graphic. This may be extended to a vector space Inline graphic with elements consisting of multivectors that can be multiplied by means of the exterior product. The geometric product Inline graphic of two vectors Inline graphic is defined by Inline graphic, where Inline graphic is the scalar inner product. The geometric product is in general not commutative though it is always associative, i.e. Inline graphic.

We denote by Inline graphic an orthonormal basis in Inline graphic, then Inline graphic. We also have Inline graphic for each Inline graphic and so in terms of the geometric product we have Inline graphic, and Inline graphic for each Inline graphic. Hence the basis vectors anticommute with respect to the geometric product. If we denote by Inline graphic the trivector

graphic file with name pone.0029015.e059.jpg (2)

then for distinct basis vectors we have

graphic file with name pone.0029015.e060.jpg (3)

where Inline graphic is the Levi-Civita symbol. We find that Inline graphic and commutes with all other elements and so has identical properties to the conventional complex number Inline graphic. Thus we have an isomorphism between the basis vectors Inline graphic and the Pauli matrices through the use of the geometric product.

In order to express quantum states in GA we use the one-to-one mapping [59][61] defined as follows

graphic file with name pone.0029015.e065.jpg (4)

where Inline graphic are real scalars.

It can then be shown using the Schmidt decomposition of a general two qubit state [61], that a general two-particle state can be represented in GA as

graphic file with name pone.0029015.e067.jpg (5)

where Inline graphic is a measure of the entanglement and where Inline graphic are single particle rotors applied to the first and second qubit, respectively. General unitary operations are called [59] rotors in GA, represented as

graphic file with name pone.0029015.e070.jpg (6)

This rotation, in Euler angle form, can completely explore the available space of a single qubit, and is equivalent to a general unitary transformation acting on a spinor. So, we have the rotors for each qubit defined as

graphic file with name pone.0029015.e071.jpg (7)
graphic file with name pone.0029015.e072.jpg (8)

For example, for Inline graphic and Inline graphic, we find the Bell state, and Inline graphic and Inline graphic and Inline graphic we recover the singlet state. This can be checked using Eq. (4), where we note that Inline graphic.

To simulate the process of measurement in GA, we form a separable state Inline graphic, where Inline graphic and Inline graphic are single particle rotors, which allow general measurement directions to be specified, on the first and second qubit respectively. The state to be measured is now projected onto the separable state Inline graphic. In the Inline graphic-particle case, the probability that the quantum state Inline graphic returns the separable state Inline graphic is given is Ref. [50] as

graphic file with name pone.0029015.e086.jpg (9)

where the angle brackets Inline graphic mean to retain only the scalar part of the expression. As noted by Doran, ‘Expressions such as this are unique to the geometric algebra approach’ [59]. We have the two observables Inline graphic and Inline graphic, which in the two particle case involves [59]

graphic file with name pone.0029015.e090.jpg (10)

The Inline graphic operator is analogous to complex conjugation, flipping the sign of Inline graphic and inverting the order of terms. The measurement outcomes given by Inline graphic and Inline graphic relate to standard quantum mechanics observables as follows:

graphic file with name pone.0029015.e095.jpg (11)

where Inline graphic are the standard Pauli matrices [59].

Results

Employing Eq. (9), we firstly calculate

graphic file with name pone.0029015.e097.jpg (12)

To describe the players measurement directions, we have Inline graphic and Inline graphic. For the quantum game in the EPR setting, Inline graphic can be either of Alice's two directions i.e. Inline graphic or Inline graphic. Similarly, in the expression for Inline graphic the Inline graphic can be either of Bob's two directions i.e. Inline graphic or Inline graphic. Hence we obtain

graphic file with name pone.0029015.e107.jpg (13)

Now from Eq. (9), we calculate

graphic file with name pone.0029015.e108.jpg (14)

where Inline graphic refers to measuring a Inline graphic or a Inline graphic state, respectively, and using Eq. (49) we have

graphic file with name pone.0029015.e112.jpg (15)

Also, from Eq. (9) we obtain

graphic file with name pone.0029015.e113.jpg (16)

where

graphic file with name pone.0029015.e114.jpg (17)
graphic file with name pone.0029015.e115.jpg (18)
graphic file with name pone.0029015.e116.jpg (19)

Now combining Eq. (14) and Eq. (16), where we define Inline graphic, we have the probability to observe a particular state

graphic file with name pone.0029015.e118.jpg (20)

To simplify notation we have written Inline graphic , Inline graphic and Inline graphic, where Inline graphic represent the two possible measurement directions available to each player. If we put Inline graphic, that is, for no entanglement, we have the probability

graphic file with name pone.0029015.e124.jpg (21)

which shows a product state incorporating general measurement directions for each qubit. This formula for Inline graphic and Inline graphic in Eq. 15 can be given a geometric interpretation as the projection of the polarization axis of a qubit, as envisaged on the Bloch sphere, onto the measurement plane Inline graphic (based on the definition of the measurement rotor given earlier as Inline graphic). For example as a special case, with Inline graphic, we have from Eq. (15) that Inline graphic, which is simply the difference in angle between the polarization axis and measurement axis. The case with two entangled qubits is more complex, as not just the initial polarization axis Inline graphic, but also the axes Inline graphic and Inline graphic of each qubit effect the measurement outcome in a non-trivial manner. It has been shown that two qubits can described in a real Inline graphic space using geometric algebra, and entangling operations involve rotating planes within this space [67].

Finding the payoff relations

We allow each player the classical probabilistic choice between their two chosen measurement directions for their Stern-Gerlach detectors. The two players, Alice and Bob choose their first measurement direction with probability Inline graphic and Inline graphic respectively, where Inline graphic. Now, we have the mathematical expectation of Alice's payoff, where she chooses the direction Inline graphic with probability Inline graphic and the measurement direction Inline graphic with probability Inline graphic, as

graphic file with name pone.0029015.e142.jpg (22)

where we have used the payoff matrix, defined for Alice, in Eq. (1) and the subscript Inline graphic refers to Alice. We also define

graphic file with name pone.0029015.e144.jpg (23)

so that by using Eqs. (20) the payoff for Alice (22) is expressed as

graphic file with name pone.0029015.e145.jpg (24)

where Inline graphic. Bob's payoff, when Alice plays Inline graphic and Bob plays Inline graphic can now be obtained by interchanging Inline graphic and Inline graphic in the right hand side of Eq. (24).

Solving the general two-player game

We now find the optimal solutions by calculating the Nash equilibrium (NE), that is, the expected response assuming rational self interest. To find the NE we simply require

graphic file with name pone.0029015.e151.jpg (25)

which is stating that any unilateral movement of a player away from the NE of Inline graphic, will result in a lower payoff for that player. We find

graphic file with name pone.0029015.e153.jpg (26)

and for the second player Bob we have similarly

graphic file with name pone.0029015.e154.jpg (27)

Embedding the classical game

To embed the classical game, we require at zero entanglement, not only the same pair of strategies being a NE but also to have the bilinear structure of the classical payoff relations. At a NE of Inline graphic, with zero entanglement, we find the payoff from Eq. (24) to be

graphic file with name pone.0029015.e156.jpg (28)

This result illustrates how we could select any one of the payoff entries we desire with the appropriate selection of Inline graphic and Inline graphic, however in order to achieve the classical payoff of Inline graphic for this NE, we can see that we require Inline graphic and Inline graphic. If we have a game which also has a classical NE of Inline graphic then from Eq. (24) at zero entanglement we find the payoff

graphic file with name pone.0029015.e163.jpg (29)

So, we can see, that we can select the required classical payoff, of Inline graphic, by the selection of Inline graphic and Inline graphic.

Referring to Eq. (15), we then have the conditions

graphic file with name pone.0029015.e167.jpg (30)
graphic file with name pone.0029015.e168.jpg (31)

Looking at the equation for Alice, we have two classes of solution: If Inline graphic, then for the equations satisfying Inline graphic, we have for Alice in the first equation Inline graphic, Inline graphic or Inline graphic, Inline graphic and for the equations satisfying Inline graphic, we have Inline graphic or Inline graphic, which can be combined to give either Inline graphic Inline graphic and Inline graphic or Inline graphic Inline graphic and Inline graphic. For the second class with Inline graphic, we have the solution Inline graphic and for Inline graphic we have Inline graphic.

So, in summary, for both cases we have that the two measurement directions are Inline graphic out of phase with each other, and for the first case (Inline graphic) we can freely vary Inline graphic and Inline graphic, and for the second case (Inline graphic), we can freely vary Inline graphic and Inline graphic to change the initial quantum quantum state without affecting the game NE or the payoffs. The same arguments hold for the equations for Inline graphic. Combining these results and substituting into Eq. (19), we find that

graphic file with name pone.0029015.e196.jpg (32)

and hence that

graphic file with name pone.0029015.e197.jpg (33)

This then reduces the equation governing the NE in Eq. (26) to

graphic file with name pone.0029015.e198.jpg (34)

which now has the new quantum behavior governed solely by the entanglement angle Inline graphic. We have the associated payoffs

graphic file with name pone.0029015.e200.jpg (35)

Setting Inline graphic in Eq. (35) we find

graphic file with name pone.0029015.e202.jpg (36)

which has the classical bilinear payoff structure in terms of Inline graphic and Inline graphic. Hence we have faithfully embedded the classical game inside a quantum version of the game, when the entanglement goes to zero.

We also have the probabilities for each state Inline graphic, after measurement from Eq. (20), for this form of the quantum game as

graphic file with name pone.0029015.e206.jpg (37)

for the two measurement directions Inline graphic and Inline graphic.

Examples

Here we explore the above results for the games of Prisoners' Dilemma and Stag Hunt. The quantum versions of these games are discussed in Refs. [9], [11], [19], [20], [24], [44].

Prisoners' Dilemma

The game of Prisoners' Dilemma (PD) [6] is widely known to economists, social and political scientists and is one of the earliest games to be investigated in the quantum regime [9]. Prisoner dilemma describes the following situation: two suspects are investigated for a crime that authorities believe they have committed together. Each suspect is placed in a separate cell and may choose between not confessing or confessing to have committed the crime. Referring to the matrices (1) we take Inline graphic and Inline graphic and identify Inline graphic and Inline graphic to represent the strategies of ‘not confessing’ and ‘confessing’, respectively. If neither suspect confesses, i.e. Inline graphic, they go free, which is represented by Inline graphic units of payoff for each suspect. The situation Inline graphic or Inline graphic represents in which one prisoner confesses while the other does not. In this case, the prisoner who confesses gets Inline graphic units of payoff, which represents freedom as well as financial reward as Inline graphic, while the prisoner who did not confess gets Inline graphic, represented by his ending up in the prison. When both prisoners confess, i.e. Inline graphic, they both are given a reduced term represented by Inline graphic units of payoff, where Inline graphic, but it is not so good as going free i.e. Inline graphic.

With reference to Eq. (23), we thus have Inline graphic Inline graphic. However, depending on the relative sizes of Inline graphic Inline graphic the quantity Inline graphic can be positive or negative. At maximum entanglement (Inline graphic), we note from Eq. (34), that there are two cases depending on Inline graphic. If Inline graphic, we notice that both the NE of Inline graphic and Inline graphic are present, and from Eq. (35) we have the payoff in both cases

graphic file with name pone.0029015.e234.jpg (38)

which is a significant improvement over the classical payoff of Inline graphic. For Inline graphic, we have the two NE of Inline graphic and Inline graphic, and from Eq. (35) we have the payoff

graphic file with name pone.0029015.e239.jpg (39)

If we reduce the entanglement of the qubits provided for the game, increasing Inline graphic towards one, then from Eq. (34), we find a phase phase transition to the classical NE of Inline graphic, at Inline graphic or

graphic file with name pone.0029015.e243.jpg (40)

Because we know that Inline graphic Inline graphic, for the PD game, then a phase transition to the classical NE is guaranteed to occur, in the range Inline graphic.

Consider a particular example of PD by taking Inline graphic Inline graphic Inline graphic and Inline graphic in matrices (1). From (23) we find Inline graphic Inline graphic and Inline graphic and we obtain Inline graphic for a transition to the classical NE. Thus, for this PD game, to generate a non-classical NE the entanglement parameter Inline graphic should be greater than Inline graphic. The new NE and payoffs can be calculated from Eq. (34) and Eq. (35) respectively, and refer to Fig. 2 for a diagram detailing these new NE and payoffs. For example the equation for the payoffs in the classical region (Inline graphic) becomes Inline graphic.

Figure 2. The PD game played in an EPR setting.

Figure 2

We see that the classical equilibrium of Inline graphic and the corresponding payoff of one unit is returned at zero entanglement (Inline graphic). As the entanglement is increased, the payoff for each player increases until the entanglement reaches Inline graphic at which point there is a phase transition to new N.E of Inline graphic and Inline graphic. At maximum entanglement both players payoffs are equal at Inline graphic units, well above the classical payoff of one unit, and close to the Pareto optimal payoff of three units.

Stag Hunt

The game of Stag Hunt (SH) [6] is encountered in the problems of social cooperation. For example, if two hunters are hunting for food, in a situation where they have two choices, either to hunt together and kill a stag, which provides a large meal, or become distracted and hunt rabbits separately instead, which while tasty, make a substantially smaller meal. Hunting a stag of course is quite challenging and the hunters need to cooperate with each other in order to be successful. The game of SH has three classical NE, two of which are pure and one is mixed. The two pure NE correspond to the situation where both hunters hunt the stag as a team or where each hunts rabbits by himself.

The SH game can be defined by the conditions Inline graphic and Inline graphic and Inline graphic. In the classical (mixed-strategy) version of this game three NE (two pure and one mixed) appear consisting of Inline graphic, Inline graphic and Inline graphic. From Eq. (34) and the defining conditions of SH game we notice that both the strategy pairs Inline graphic and Inline graphic also remain NE in the quantum game for an arbitrary Inline graphic. Eq. (35) give the players' payoffs at these NE as follows:

graphic file with name pone.0029015.e274.jpg (41)
graphic file with name pone.0029015.e275.jpg (42)

which assume the values Inline graphic and Inline graphic at Inline graphic, respectively. When Inline graphic we have Inline graphic For the mixed NE for the quantum SH game we require from Eq. (34), Inline graphic or

graphic file with name pone.0029015.e282.jpg (43)

which returns the classical mixed NE of Inline graphic at zero entanglement. Depending on the amount of entanglement, the pair Inline graphic, however, will shift themselves between Inline graphic and Inline graphic. Players' payoffs at this shifted NE can be obtained from Eq. (35). Consider a particular example of SH by taking Inline graphic Inline graphic Inline graphic and Inline graphic in matrices (1). From (23) we find Inline graphic Inline graphic and Inline graphic. At Inline graphic we have Inline graphic. That is, the players' payoffs at the NE strategy pair Inline graphic are increased from Inline graphic to Inline graphic while at the NE strategy pair Inline graphic these are decreased from Inline graphic to Inline graphic. The mixed NE in the classical game is at Inline graphic whereas it shifts to Inline graphic at Inline graphic.

Discussion

The EPR type setting for playing a quantum version of a two-player two-strategy game is explored using the formalism of Clifford geometric algebra (GA), used for the representation of the quantum states, and the calculation of observables. We find that analyzing quantum games using GA comes with some clear benefits, for instance, improved perception of the quantum mechanical situation involved and particularly an improved geometrical visualization of quantum operations. To obtain equivalent results using the familiar algebra with Pauli matrices would be possible but obscures intuition. We also find that an improved geometrical visualization becomes helpful in significantly simplifying quantum calculations, for example unitary transformations on a single qubit become simply rotations of a vector as displayed on the Bloch sphere, and two qubits can be modeled in a real Inline graphic space [67] and we also find unique expressions in GA, such as Eq. (9) describing measurement outcomes for Inline graphic qubits.

We find that by using an EPR type setting we produce a faithful embedding of symmetric mixed-strategy versions of classical two-player two-strategy games into its quantum version, and that GA provides a simplified formalism over the field of reals for describing quantum states and measurements.

For a general two-player two-strategy game, we find the governing equation for a strategy pair forming a NE and the associated payoff relations. We find that at zero entanglement the quantum game returns the same pair(s) of NE as the classical mixed-strategy game, while the payoff relations in the quantum game reduce themselves to their bilinear form corresponding to a mixed-strategy classical game. We find that, within our GA based analysis, even though the requirement to properly embed a classical game puts constraints on the possible quantum states allowing this, we still have a degree of freedom, available with the entanglement angle Inline graphic, with which we can generate new NE. As a specific example the PD was found to have a NE of Inline graphic at high entanglement.

Analysis of quantum PD game in this paper can be compared with the results developed for this game in Ref. [34] also using an EPR type setting, directly from a set of non-factorizable joint probabilities. Although Ref. [34] and the present paper both use an EPR type setting, they use non-factorizability and entanglement for obtaining a quantum game, respectively. Our recent work [47] has observed that Ref. [34] does not take into consideration a symmetry constraint on joint probabilities that is relevant both when joint probabilities are factorizable or non-factorizable. When this symmetry constraint is taken into consideration, an analysis of quantum PD game played using an EPR setting does generate a non-classical NE in agreement with the results in this paper.

The EPR setting represents a simplified quantum game framework retaining classical strategies, but allowing quantum mechanical features such as entanglement to be employed in classical games. A more general scheme can be described allowing full use of unitary operations by each player, which is a useful framework when contact is not essential with a corresponding classical game. An even more general framework than quantum mechanics can be described, based on the properties of non-factorizable joint probabilities [47].

Analysis

Calculating the observables

These three results are useful when calculating measurement outcomes in an EPR experiment, with a measurement direction Inline graphic, with a qubit defined by a rotor

graphic file with name pone.0029015.e310.jpg (44)

and for measurement we use a rotor

graphic file with name pone.0029015.e311.jpg (45)

defining rotations in the plane. We evaluate the quantities Inline graphic Inline graphic and Inline graphic as follows.

graphic file with name pone.0029015.e315.jpg (46)
graphic file with name pone.0029015.e316.jpg (47)
graphic file with name pone.0029015.e317.jpg (48)

We thus find for a general measurement direction Inline graphic, the following results

graphic file with name pone.0029015.e319.jpg (49)

Footnotes

Competing Interests: The authors have declared that no competing interests exist.

Funding: No current external funding sources exist for this study.

References

  • 1.Blaquiere A. Wave mechanics as a two-player game. Dynamical Systems and Microphysics. 1980:33–69. [Google Scholar]
  • 2.Wiesner S. Conjugate coding. ACM Sigact News. 1983;15:78–88. [Google Scholar]
  • 3.Mermin N. Quantum mysteries revisited. American Journal of Physics. 1990;58:731–734. [Google Scholar]
  • 4.Mermin N. Extreme quantum entanglement in a superposition of macroscopically distinct states. Physical Review Letters. 1990;65:1838–1840. doi: 10.1103/PhysRevLett.65.1838. [DOI] [PubMed] [Google Scholar]
  • 5.Binmore K. Game theory: a very short introduction, volume 173. 2007. Oxford University Press, USA.
  • 6.Rasmusen E. Games and information: An introduction to game theory. Wiley-Blackwell; 2007. [Google Scholar]
  • 7.Peres A. Quantum theory: concepts and methods, volume 57. Kluwer Academic Publishers; 1993. [Google Scholar]
  • 8.Meyer D. Quantum strategies. Physical Review Letters. 1999;82:1052–1055. [Google Scholar]
  • 9.Eisert J, Wilkens M, Lewenstein M. Quantum games and quantum strategies. Physical Review Letters. 1999;83:3077–3080. [Google Scholar]
  • 10.Vaidman L. Time-symmetrized counterfactuals in quantum theory. Foundations of physics. 1999;29:755–765. [Google Scholar]
  • 11.Benjamin S, Hayden P. Multiplayer quantum games. Physical Review A. 2001;64:030301. doi: 10.1103/PhysRevLett.87.069801. [DOI] [PubMed] [Google Scholar]
  • 12.van Enk SJ, Pike R. Classical rules and quantum games. Phys Rev A. 2002;66:024306. [Google Scholar]
  • 13.Johnson N. Playing a quantum game with a corrupted source. Phys Rev A. 2001;63(2) [Google Scholar]
  • 14.Marinatto L, Weber T. A quantum approach to games of static information. Phys Lett A. 2000;272:291–303. [Google Scholar]
  • 15.Iqbal A, Toor A. Evolutionarily stable strategies in quantum games. Physics Letters A. 2001;280:249–256. [Google Scholar]
  • 16.Du J, Li H, Xu X, Zhou X, Han R. Entanglement enhanced multiplayer quantum games. Physics Letters A. 2002;302:229–233. [Google Scholar]
  • 17.Du J, Li H, Xu X, Shi M, Wu J, et al. Experimental realization of quantum games on a quantum computer. Physical Review Letters. 2002;88:137902. doi: 10.1103/PhysRevLett.88.137902. [DOI] [PubMed] [Google Scholar]
  • 18.Piotrowski E, Sadkowski J. Quantum market games. Physica A: Statistical Mechanics and its Applications. 2002;312:208–216. [Google Scholar]
  • 19.Flitney A, Abbott D. Advantage of a quantum player over a classical one in 2×2 quantum games. Royal Society of London Proceedings Series A. 2003;459:2463–2474. [Google Scholar]
  • 20.Flitney AP, Abbott D. An introduction to quantum game theory. Fluctuation and Noise Letters. 2002;2:R175. [Google Scholar]
  • 21.Iqbal A, Toor A. Backwards-induction outcome in a quantum game. Physical Review A. 2002;65:052328. [Google Scholar]
  • 22.Piotrowski E, Sladkowski J. An invitation to quantum game theory. International Journal of Theoretical Physics. 2003;42:1089–1099. [Google Scholar]
  • 23.Shimamura J, Ozdemir S, Morikoshi F, Imoto N. Entangled states that cannot reproduce original classical games in their quantum version. Physics Letters A. 2004;328:20–25. [Google Scholar]
  • 24.Flitney A, Abbott D. Quantum games with decoherence. Journal of Physics A: Mathematical and General. 2005;38:449. [Google Scholar]
  • 25.Iqbal A, Weigert S. Quantum correlation games. Journal of Physics A: Mathematical and General. 2004;37:5873. [Google Scholar]
  • 26.Mendes R. The quantum ultimatum game. Quantum Information Processing. 2005;4:1–12. [Google Scholar]
  • 27.Cheon T, Tsutsui I. Classical and quantum contents of solvable game theory on Hilbert space. Physics Letters A. 2006;348:147–152. [Google Scholar]
  • 28.Iqbal A. Playing games with EPR-type experiments. Journal of Physics A: Mathematical and General. 2005;38:9551. [Google Scholar]
  • 29.Nawaz A, Toor A. Generalized quantization scheme for two-person non-zero sum games. Journal of Physics A: Mathematical and General. 2004;37:11457. [Google Scholar]
  • 30.Cheon T. Game theory formulated on hilbert space. Quantum Computing: Back Action. 2006;864:254–260. [Google Scholar]
  • 31.Shimamura J, Özdemir S, Morikoshi F, Imoto N. Quantum and classical correlations between players in game theory. International Journal of Quantum Information. 2004;2:79–89. [Google Scholar]
  • 32.Ichikawa T, Tsutsui I. Duality, phase structures, and dilemmas in symmetric quantum games. Annals of Physics. 2007;322:531–551. [Google Scholar]
  • 33.Özdemir S, Shimamura J, Imoto N. A necessary and suffIcient condition to play games in quantum mechanical settings. New Journal of Physics. 2007;9:43. [Google Scholar]
  • 34.Iqbal A, Cheon T. Constructing quantum games from nonfactorizable joint probabilities. Physical Review E. 2007;76:061122. doi: 10.1103/PhysRevE.76.061122. [DOI] [PubMed] [Google Scholar]
  • 35.Ramzan M, Nawaz A, Toor A, Khan M. The effect of quantum memory on quantum games. Journal of Physics A: Mathematical and Theoretical. 2008;41:055307. [Google Scholar]
  • 36.Flitney A, Hollenberg L. Nash equilibria in quantum games with generalized two-parameter strategies. Physics Letters A. 2007;363:381–388. [Google Scholar]
  • 37.Aharon N, Vaidman L. Quantum advantages in classically defined tasks. Physical Review A. 2008;77:052310. [Google Scholar]
  • 38.Bleiler S. A formalism for quantum games and an application. 2008. Arxiv preprint arXiv:08081389.
  • 39.Ahmed A, Bleiler S, Khan F. Arxiv preprint arXiv:08081391; 2008. Three player, two strategy, maximally entangled quantum games. [Google Scholar]
  • 40.Guo H, Zhang J, Koehler G. A survey of quantum games. Decision Support Systems. 2008;46:318–332. [Google Scholar]
  • 41.Ichikawa T, Tsutsui I, Cheon T. Quantum game theory based on the Schmidt decomposition. Journal of Physics A: Mathematical and Theoretical. 2008;41:135303. [Google Scholar]
  • 42.Iqbal A, Cheon T, Abbott D. Probabilistic analysis of three-player symmetric quantum games played using the Einstein-Podolsky-Rosen-Bohm setting. Physics Letters A. 2008;372:6564–6577. [Google Scholar]
  • 43.Li Q, He Y, Jiang J. A novel clustering algorithm based on quantum games. Journal of Physics A: Mathematical and Theoretical. 2009;42:445303. [Google Scholar]
  • 44.Iqbal A, Abbott D. Non-factorizable joint probabilities and evolutionarily stable strategies in the quantum prisoner's dilemma game. Physics Letters A. 2009;373:2537–2541. [Google Scholar]
  • 45.Iqbal A, Abbott D. Quantum matching pennies game. Journal of the Physical Society of Japan. 2009;78:014803. [Google Scholar]
  • 46.Chappell J, Iqbal A, Lohe M, Von Smekal L. An analysis of the quantum penny ip game using geometric algebra. Journal of the Physical Society of Japan. 2009;78:054801. [Google Scholar]
  • 47.Chappell J, Iqbal A, Abbott D. Constructing quantum games from symmetric nonfactorizable joint probabilities. Physics Letters A. 2010;374:4104–4111. [Google Scholar]
  • 48.J M Chappell AI, Lohe MA. Analyzing three-player quantum games in an EPR type setup. PLoS ONE. 2011;6(7):e21623. doi: 10.1371/journal.pone.0021623. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 49.Einstein A, Podolsky B, Rosen N. Can quantum-mechanical description of physical reality be considered complete? Physical review. 1935;47:777–780. [Google Scholar]
  • 50.Bohm D. Quantum theory. Dover Publications; 1951. [Google Scholar]
  • 51.Bell J. On the Einstein-Podolsky-Rosen paradox. Physics. 1964;1:195–200. [Google Scholar]
  • 52.Bell J. Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press; 1987. [Google Scholar]
  • 53.Bell J. On the problem of hidden variables in quantum mechanics. Reviews of Modern Physics. 1966;38:447–452. [Google Scholar]
  • 54.Aspect A, Dalibard J, Roger G. Experimental test of Bell's inequalities using time-varying analyzers. Physical Review Letters. 1982;49:1804–1807. [Google Scholar]
  • 55.Clauser J, Shimony A. Bell's theorem. experimental tests and implications. Reports on Progress in Physics. 1978;41:1881. [Google Scholar]
  • 56.Cereceda J. Quantum mechanical probabilities and general probabilistic constraints for Einstein- Podolsky- Rosen- Bohm experiments. Foundations of Physics Letters. 2000;13:427–442. [Google Scholar]
  • 57.Hestenes D. New foundations for classical mechanics: Fundamental Theories of Physics. Kluwer Academic Pub; 1999. [Google Scholar]
  • 58.Hestenes D, Sobczyk G. Clifford Algebra to Geometric Calculus: A unified language for mathematics and physics, volume 5. Springer; 1984. [Google Scholar]
  • 59.Doran C, Lasenby A. Geometric Algebra for Physicists. Cambridge University Press; 2003. [Google Scholar]
  • 60.De Sabbata V, Datta B. Geometric Algebra and Applications to Physics. Taylor & Francis Group; 2007. [Google Scholar]
  • 61.Parker R, Doran C. Analysis of 1 and 2 particle quantum systems using geometric algebra. 2001. Arxiv preprint quant-ph/0106055.
  • 62.Chappell J, Iqbal A, Abbott D. Geometric algebra: A natural representation of three-space. 2011. Arxiv preprint arXiv:11013619.
  • 63.Chappell J, Iannella N, Iqbal A, Abbott D. Revisiting special relativity: A natural algebraic alternative to Minkowski spacetime. 2011. Arxiv preprint arXiv:11063748. [DOI] [PMC free article] [PubMed]
  • 64.Christian J. Disproof of Bell's theorem by Clifford algebra valued local variables. 2007. Arxiv preprint quant-ph/0703179.
  • 65.Christian J. Restoring local causality and objective reality to the entangled photons. 2011. Arxiv preprint arXiv:11060748.
  • 66.Szekeres P. A course in modern mathematical physics: groups, Hilbert space, and differential geometry. Cambridge Univ. Press; 2004. [Google Scholar]
  • 67.Havel T, Doran C. A bloch-sphere-type model for two qubits in the geometric algebra of a 6-D Euclidean vector space. 2004. Arxiv preprint quant-ph/0403136.

Articles from PLoS ONE are provided here courtesy of PLOS

RESOURCES