N-Player Quantum Games in an EPR Setting

The [Image: see text]-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 [Image: see text]-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’ [Image: see text] payoff matrices are then defined using linear functions so that common two-player games can be easily extended to the [Image: see text]-player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners’ Dilemma game for general [Image: see text]. 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.