Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to stress the new features of the games that may be revealed in their quantum versions. We first introduce from scratch the most fundamental facts of finite-dimensional quantum mechanics. In the main sections the foundations of quantum games are built via the basic examples. We omit sometimes the lengthy calculations (referring to the original papers) once the physical part is sorted out and the problem is reformulated as pure game-theoretic problem of calculating the Nash or dominated equilibria. Finally we touch upon general theory of finite quantum static games and provide further links and references.
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to stress the new features of the games that may be revealed in their quantum versions. We first introduce from scratch the most fundamental facts of finite-dimensional quantum mechanics. In the main sections the foundations of quantum games are built via the basic examples. We omit sometimes the lengthy calculations (referring to the original papers) once the physical part is sorted out and the problem is reformulated as pure game-theoretic problem of calculating the Nash or dominated equilibria. Finally we touch upon general theory of finite quantum static games and provide further links and references.
This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.
In the time since the merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of ``quantized games'', and of applying game theory to quantum mechanics, referred to henceforth as ``gaming the quantum'', have become synonymous under the single ill-defined term ``quantum game''. Here, these two perspectives are delineated and a game-theoretically proper description of what makes a multiplayer, non-cooperative game quantum mechanical, is given. Within the context of this description, finding Nash equilibrium in a zero-sum quantum game is exhibited to be equivalent to finding a solution to a simultaneous distance minimization problem in the state space of quantum objects, thus setting up a framework for a game theory inspired study of ``equilibrium'' behavior of quantum physical systems such as those utilized in quantum information processing and computation.
Quantum computing offers the possibility of massively parallel computing that scales to large problems in a way not possible for classical computers. It also may make possible rapid and secure forms of communication that are not possible with classical devices. As an offshoot of the quantum computing literature, a small set of papers has started to examine quantum games. The question naturally arises: what if anything does quantum game theory have for economists? This brief note attempt to summarize the sometimes impenetrable notation used in quantum physics. I argue that quantum games fall within the existing framework of correlated equilibrium, cheap-talk equilibrium and mechanism design theory, where the correlation and/or communication devices are limited in a way not terribly relevant to economic theory. The notation is taken from Cleve et al [2004], and interpreted using the Wikipedia. A quantum mechanical system has a state � , which is simply a � -dimensional
In the time since a merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of "quantized games", and of applying game theory to quantum mechanics, referred to henceforth as "gaming the quantum", have become synonymous under the single ill-defined term "quantum game". Here, these two perspectives are delineated and a game-theoretically proper description of what makes a multi-player, non-cooperative game quantum mechanical, is given. Within the context of this description, finding a Nash equilibrium in a strictly competitive quantum game is shown to be equivalent to finding a solution to a simultaneous best approximation problem in the state space of quantum objects, thus setting up a framework for a game theory inspired study of "equilibrium" behavior of quantum physical systems such as those utilized in quantum information processing and computation.
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to Quantumize any finite classical n-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.