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

Communications in Theoretical Physics

Generalized Quantum Games with Nash Equilibrium

Xufeng Liu

Published Apr 15, 2004• 0 citations
Publisher

Abstract

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and a two-entangled-qubit system. The Nash Equilibrium Theorem is proved for the models.
DOI
10.1088/0253-6102/41/4/553

Related papers

Generalized Quantum Games with Nash Equilibrium

Liu, X. F., Sun, C. P.

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium Theorem is proved for the models.

arXiv:quant-ph/0212045•Dec 8, 2002•3 citations

No fixed-point guarantee of Nash equilibrium in quantum games

Faisal Shah Khan, Travis S. Humble

The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg's fixed-point theorem do not apply to pure quantum games when the payoff is a physical observable. We further show that Nash equilibrium can be guaranteed when the payoff is defined with respect to state preparation.

arXiv:1609.08360•Sep 27, 2016•1 citation

New models of quantum games

Paulo Benicio Melo de Sousa, Rubens Viana Ramos, Jose Tarcisio Costa filho

In this work we propose and develop modified quantum games (zero and non-zero sum) in which payoffs and strategies are entangled. For the games studied, Nash and Pareto equilibriums are always obtained indicating that there are some interesting cases where quantum games can be applied.

arXiv:quant-ph/0608131•Aug 17, 2006•5 citations

Some Topics in Quantum Games

Y. Avishai

This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown 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. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.

arXiv:1306.0284•Jun 3, 2013•14 citations

On Topics in Quantum Games

Y. Avishai

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.

Journal of Quantum Information Science•Jan 1, 2023•9 citations

Multiplayer quantum Minority game with decoherence

Adrian P. Flitney

A quantum version of the Minority game for an arbitrary number of agents is studied. When the number of agents is odd, quantizing the game produces no advantage to the players, however, for an even number of agents new Nash equilibria appear that have no classical analogue. The new Nash equilibria provide far preferable expected payoffs to the players compared to the equivalent classical game. The effect on the Nash equilibrium payoff of reducing the degree of entanglement, or of introducing decoherence into the model, is indicated.

arXiv:quant-ph/0510108•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 23, 2005•8 citations
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg's fixed-point theorem do not apply to pure quantum games when the payoff is a physical observable. We further show that Nash equilibrium can be guaranteed when the payoff is defined with respect to state preparation.
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown 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. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.
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.
A quantum version of the Minority game for an arbitrary number of agents is studied. When the number of agents is odd, quantizing the game produces no advantage to the players, however, for an even number of agents new Nash equilibria appear that have no classical analogue. The new Nash equilibria provide far preferable expected payoffs to the players compared to the equivalent classical game. The effect on the Nash equilibrium payoff of reducing the degree of entanglement, or of introducing decoherence into the model, is indicated.