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

Journal of Quantum Information Science

On Topics in Quantum Games

Y. Avishai

Published Jan 1, 2023• 9 citations
Publisher

Abstract

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.

DOI
10.4236/jqis.2023.133006

Related papers

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

Quantum games: Numerical approach

Y. Avishai

In classical (standard) game theory, a useful algorithm for searching Nash equilibrium in games of two players, is to determine the best response functions. For each strategy S1 of player 1 player 2 finds a best response function F2(S1), and vice versa. If the two response functions intersect, the intersection point (S1*, S2*) is a candidate for Nash equilibrium. This method is especially useful when the strategy space of each player is determined by a single variable (discrete or continuous). In the last decade, the concept of quantum games has been developed (hence we distinguish between classical and quantum games). In a quantum game with two players the strategy space of each player is composed of 2 × 2 complex unitary matrices with unit determinant. That is the group SU(2). The corresponding strategy space is characterized by three continuous variables represented by angles: 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, 0 ≤ θ ≤ π. That turns the use of response functions impractical. In the present contribution we suggest a method for alleviating this problem by discretizing the variables as: {αi, βj, θk}, i= 1, 2, ..., I; j = 1, 2, ..., J; k = 1, 2, ... K. This enables the representation of every such triple by a single discrete variable, (αi, βj, θk) → xijk. Thereby, the strategy space is characterized by a single discrete variable taking I × J × K values and the method of response functions is feasible. We use it to show the following two results: 1) A two players quantum game with partially entangled initial state has a pure strategy Nash equilibrium. 2) A two player quantum Bayesian game with fully entangled initial state has a pure strategy Nash equilibrium.

International Conference on Natural Computation (ICNC)•May 1, 2012•1 citation

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•45 citations

Constructing Entanglers in 2-Players–N-Strategies Quantum Game

Y. Avishai

In quantum games based on 2-player-N-strategies classical games, each player has a quNit (a normalized vector in an N-dimensional Hilbert space HN) upon which he applies his strategy (a matrix U∈SU(N)). The players draw their payoffs from a state . Here and J (both determined by the game’s referee) are respectively an unentangled 2-quNit (pure) state and a unitary operator such that is partially entangled. The existence of pure strategy Nash equilibrium in the quantum game is intimately related to the degree of entanglement of . Hence, it is practical to design the entangler J= J(β) to be dependent on a single real parameter β that controls the degree of entanglement of , such that its von-Neumann entropy SN(β) is continuous and obtains any value in . Designing J(β) for N=2 is quite standard. Extension to N>2 is not obvious, and here we suggest an algorithm to achieve it. Such construction provides a special quantum gate that should be a useful tool not only in quantum games but, more generally, as a special gate in manipulating quantum information protocols.

arXiv:1402.1982•Journal of Quantum Information Science•Jan 1, 2015•5 citations

Nash Equilibria in Four-Strategy Quantum Extensions of the Prisoner’s Dilemma Game

Piotr Frąckiewicz, Anna Gorczyca–Goraj, Krzysztof Grzegorz Grzanka +2 more

The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.

arXiv:2411.01711•Entropy•Jul 15, 2025•3 citations

Application of Game-theoretic Techniques to Quantum Information Theory

Muhammad Asif Ramzan

This work is mainly based on quantum game-theoretic techniques and their application to quantum information theory.Quantum game theory is an important development in quantum computation and may have implications for quantum information and quantum communication.The select of quantum memory on quantum games have been studied.Three di􀀞erent games such as, Prisoner Dilemma, Battle of the Sexes and Chicken have been analyzed in the quantum domain. By considering the restricted game \nsituation, it is shown that the ects of quantum memory and decoherence become e􀀞ective in a maximally entangled case.For which the quantum player can out perform the classical player in all the three games. It is also shown that the quantum player enjoys an advantage over the classical player in Battle of the Sexes game for the amplitude-damping and the depolarizing channels.The quantum memory compensates the reduction in player pay is due to decoherence. It has no ect on the Nash equilibria of the three games.A generalization of two-player quantization scheme to a three-player Prisoners Dilemma game under the ect of correlated noise is also presented.In a restricted game scenario, it is shown the quantumplayer is always better; for all values of the decoherence parameter for the entire range of memory parameter.It is seen that for maximum degree of correlation, the game does not become \nnoiseless and quantum player can still outscore the classical players for the entire range of the decoherence parameter producing an interesting result in comparison with a two-player quantum game.It is also shown that correlated noise has not on the Nash equilibrium of the game.By exploiting the three-player quantization scheme, we have studiedthe communication aspects of a three-player Prisoner Dilemma quantum game. It is shown that entanglement plays a dominant role in a three-player quantum game.On the baois of initial state and the measurement basis entanglement parameters, a relation among different pay is established.It is investigated that the strategies of the players act as information carriers in quantum games. A relationship for the information shared among the parties is also established.A scheme for quantum key distribution is proposed in which a secret key can be generated from the data coming through a partially entanglement breaking channel.This scheme is rather deterministic andcient in the sense that two classical bits can be transferred \nper entangled pair of qubits.Furthermore, it is important to point out that, in this scheme, same symbol can be used for Eve detection and key generation. It is also worth noting that the eavesdropper, Eve, can be detected very easily from the disturbance of the elements of the decoding bimatrix. We have checked for the \nsecurity of the scheme and found it secure against individual attacks.It is further investigated that quantum games are useful in developing quantum cryptographic protocols.A multiparty quantum cryptographic protocol using tripartite entangled GHZ states is devised using game-theoretic techniques.In this protocol, two classical bits can be transferred per entangled pair of qubits to the communicating parties.Unitary operators applied by the sender on a tripartite entangled state encodes a classical symbol that can be decoded at receiver end with the help of a decoding matrix. In this protocol, if Eve interferes during the transmission, she can be detected by the disturbance of the decoding matrix. Our security analysis shows that this protocol is also secure against intercept/re-send attacks.

•Jan 1, 2010•0 citations
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.
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.
In classical (standard) game theory, a useful algorithm for searching Nash equilibrium in games of two players, is to determine the best response functions. For each strategy S1 of player 1 player 2 finds a best response function F2(S1), and vice versa. If the two response functions intersect, the intersection point (S1*, S2*) is a candidate for Nash equilibrium. This method is especially useful when the strategy space of each player is determined by a single variable (discrete or continuous). In the last decade, the concept of quantum games has been developed (hence we distinguish between classical and quantum games). In a quantum game with two players the strategy space of each player is composed of 2 × 2 complex unitary matrices with unit determinant. That is the group SU(2). The corresponding strategy space is characterized by three continuous variables represented by angles: 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, 0 ≤ θ ≤ π. That turns the use of response functions impractical. In the present contribution we suggest a method for alleviating this problem by discretizing the variables as: {αi, βj, θk}, i= 1, 2, ..., I; j = 1, 2, ..., J; k = 1, 2, ... K. This enables the representation of every such triple by a single discrete variable, (αi, βj, θk) → xijk. Thereby, the strategy space is characterized by a single discrete variable taking I × J × K values and the method of response functions is feasible. We use it to show the following two results: 1) A two players quantum game with partially entangled initial state has a pure strategy Nash equilibrium. 2) A two player quantum Bayesian game with fully entangled initial state has a pure strategy Nash equilibrium.
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.
In quantum games based on 2-player-N-strategies classical games, each player has a quNit (a normalized vector in an N-dimensional Hilbert space HN) upon which he applies his strategy (a matrix U∈SU(N)). The players draw their payoffs from a state . Here and J (both determined by the game’s referee) are respectively an unentangled 2-quNit (pure) state and a unitary operator such that is partially entangled. The existence of pure strategy Nash equilibrium in the quantum game is intimately related to the degree of entanglement of . Hence, it is practical to design the entangler J= J(β) to be dependent on a single real parameter β that controls the degree of entanglement of , such that its von-Neumann entropy SN(β) is continuous and obtains any value in . Designing J(β) for N=2 is quite standard. Extension to N>2 is not obvious, and here we suggest an algorithm to achieve it. Such construction provides a special quantum gate that should be a useful tool not only in quantum games but, more generally, as a special gate in manipulating quantum information protocols.
The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.
This work is mainly based on quantum game-theoretic techniques and their application to quantum information theory.Quantum game theory is an important development in quantum computation and may have implications for quantum information and quantum communication.The select of quantum memory on quantum games have been studied.Three di􀀞erent games such as, Prisoner Dilemma, Battle of the Sexes and Chicken have been analyzed in the quantum domain. By considering the restricted game \nsituation, it is shown that the ects of quantum memory and decoherence become e􀀞ective in a maximally entangled case.For which the quantum player can out perform the classical player in all the three games. It is also shown that the quantum player enjoys an advantage over the classical player in Battle of the Sexes game for the amplitude-damping and the depolarizing channels.The quantum memory compensates the reduction in player pay is due to decoherence. It has no ect on the Nash equilibria of the three games.A generalization of two-player quantization scheme to a three-player Prisoners Dilemma game under the ect of correlated noise is also presented.In a restricted game scenario, it is shown the quantumplayer is always better; for all values of the decoherence parameter for the entire range of memory parameter.It is seen that for maximum degree of correlation, the game does not become \nnoiseless and quantum player can still outscore the classical players for the entire range of the decoherence parameter producing an interesting result in comparison with a two-player quantum game.It is also shown that correlated noise has not on the Nash equilibrium of the game.By exploiting the three-player quantization scheme, we have studiedthe communication aspects of a three-player Prisoner Dilemma quantum game. It is shown that entanglement plays a dominant role in a three-player quantum game.On the baois of initial state and the measurement basis entanglement parameters, a relation among different pay is established.It is investigated that the strategies of the players act as information carriers in quantum games. A relationship for the information shared among the parties is also established.A scheme for quantum key distribution is proposed in which a secret key can be generated from the data coming through a partially entanglement breaking channel.This scheme is rather deterministic andcient in the sense that two classical bits can be transferred \nper entangled pair of qubits.Furthermore, it is important to point out that, in this scheme, same symbol can be used for Eve detection and key generation. It is also worth noting that the eavesdropper, Eve, can be detected very easily from the disturbance of the elements of the decoding bimatrix. We have checked for the \nsecurity of the scheme and found it secure against individual attacks.It is further investigated that quantum games are useful in developing quantum cryptographic protocols.A multiparty quantum cryptographic protocol using tripartite entangled GHZ states is devised using game-theoretic techniques.In this protocol, two classical bits can be transferred per entangled pair of qubits to the communicating parties.Unitary operators applied by the sender on a tripartite entangled state encodes a classical symbol that can be decoded at receiver end with the help of a decoding matrix. In this protocol, if Eve interferes during the transmission, she can be detected by the disturbance of the decoding matrix. Our security analysis shows that this protocol is also secure against intercept/re-send attacks.