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

Scientific Reports

Dilemma breaking in quantum games by joint probabilities approach

Alexis R. Legón, Ernesto A. Medina

Published Aug 5, 2022• 3 citations
Publisher

Abstract

Classical games get fundamentally modified in the quantum realm because of non-locality and entanglement, that bypass some of the crucial features of the classical problem that define a dilemma. We will analyze how the dilemma can be shunted and even completely eliminated by the players using quantum strategies from the viewpoint of joint probabilities. In this approach, the game information (entropy) needs to be incorporated into the game strategies. We also connect the potential of the formalism of quantum games with the transmission of quantum information in quantum noisy channels and recent considerations of the connection between thermalization mechanisms in statistical mechanics, the many body problem and cooperative games considered here in the quantum regime.

DOI
10.1038/s41598-022-17072-8

Related papers

Joint Probabilities Approach to Quantum Games with Noise

Alexis R. Legón, Ernesto A. Medina

A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not generically destroy entanglement. This formalism was applied to the Prisoner's Dilemma, the Chicken Game, and the Battle of the Sexes, where noise is coupled through a single parameter μ. We find that for all the games except for the Battle of the Sexes, the Nash inequalities are maintained up to a threshold value of the noise. Beyond the threshold value, the inequalities no longer hold for quantum and classical strategies. For the Battle of the sexes, the Nash inequalities always hold, no matter the noise strength. This is due to the symmetry and anti-symmetry of the parameters that determine the joint probabilities for that game. Finally, we propose a new correlation measure for the games with classical and quantum strategies, where we obtain that the incorporation of noise, when we have quantum strategies, does not affect entanglement, but classical strategies result in behavior that approximates quantum games with quantum strategies without the need to saturate the system with the maximum value of noise. In this manner, these correlations can be understood as entanglement for our game approach.

Entropy•Aug 16, 2023•7 citations

A necessary and sufficient condition to play games in quantum mechanical settings

Şahin Kaya Özdemir, Junichi Shimamura, N. Imoto

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.

arXiv:quant-ph/0508105•New Journal of Physics•Feb 28, 2007•59 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

Quantum games

Mei Lyn Jaclyn Thang

Quantum games have demonstrated to propose a new point of view for the solution of the classical problems and dilemmas in game theory. It has been shown in many literatures that quantum games are more efficient than classical games and provide a greater and more efficient solution. As interest in multi-player quantum games grow, methods are proposed to analyze and obtain efficient solutions for these problems. In quantum games with cooperation, analysis so far have taken into consideration all possible scenarios for the multiple players playing different strategies and in the calculation of payoff, setting the payoff of scenarios not possible to be zero. Chapter 5 presents the analysis of multiple players (three players and four players) using this method of analysis. In Chapter 6, a modification of the analysis was done. In Chapter 5, it should be noted that the probabilities of participating scenarios do not sum to unity which is technically not ideal. Hence Chapter 6 addresses this by performing re-normalizing the probabilities of the participating scenarios so that the probabilities sum to unity. The analysis was done for three and four player games and a comparison was made between the un-normalized method and the re-normalized method. It was found that re-normalization provides a more accurate representation of the classical game and hence can be a better solution for the quantum game.

•Jan 1, 2010•0 citations

Quantum Games and the Relationships between Quantum Mechanics and Game Theory

Esteban Guevara Hidalgo

Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum domain where the linear superposition of actions is allowed. This quantization let us describe and solution problems originated by conflicting or cooperative behaviors among the members of a system from the point of view of quantum mechanical interactions. This leads us to interesting aspects which only can be observed through the quantization of a game like the possibility of the entanglement between players, the definition of a socioeconomical temperature in a system, the collective welfare principle,the analysis of a game through elements of quantum information theory and the globalization process. The relationships between quantum mechanics and game theory are also studied and its shown how although both systems analyzed are described through two theories apparently different (quantum mechanics and game theory) both are analogous and thus exactly equivalents.

arXiv:0803.0292•Mar 3, 2008•10 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
Classical games get fundamentally modified in the quantum realm because of non-locality and entanglement, that bypass some of the crucial features of the classical problem that define a dilemma. We will analyze how the dilemma can be shunted and even completely eliminated by the players using quantum strategies from the viewpoint of joint probabilities. In this approach, the game information (entropy) needs to be incorporated into the game strategies. We also connect the potential of the formalism of quantum games with the transmission of quantum information in quantum noisy channels and recent considerations of the connection between thermalization mechanisms in statistical mechanics, the many body problem and cooperative games considered here in the quantum regime.
A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not generically destroy entanglement. This formalism was applied to the Prisoner's Dilemma, the Chicken Game, and the Battle of the Sexes, where noise is coupled through a single parameter μ. We find that for all the games except for the Battle of the Sexes, the Nash inequalities are maintained up to a threshold value of the noise. Beyond the threshold value, the inequalities no longer hold for quantum and classical strategies. For the Battle of the sexes, the Nash inequalities always hold, no matter the noise strength. This is due to the symmetry and anti-symmetry of the parameters that determine the joint probabilities for that game. Finally, we propose a new correlation measure for the games with classical and quantum strategies, where we obtain that the incorporation of noise, when we have quantum strategies, does not affect entanglement, but classical strategies result in behavior that approximates quantum games with quantum strategies without the need to saturate the system with the maximum value of noise. In this manner, these correlations can be understood as entanglement for our game approach.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
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.
Quantum games have demonstrated to propose a new point of view for the solution of the classical problems and dilemmas in game theory. It has been shown in many literatures that quantum games are more efficient than classical games and provide a greater and more efficient solution. As interest in multi-player quantum games grow, methods are proposed to analyze and obtain efficient solutions for these problems. In quantum games with cooperation, analysis so far have taken into consideration all possible scenarios for the multiple players playing different strategies and in the calculation of payoff, setting the payoff of scenarios not possible to be zero. Chapter 5 presents the analysis of multiple players (three players and four players) using this method of analysis. In Chapter 6, a modification of the analysis was done. In Chapter 5, it should be noted that the probabilities of participating scenarios do not sum to unity which is technically not ideal. Hence Chapter 6 addresses this by performing re-normalizing the probabilities of the participating scenarios so that the probabilities sum to unity. The analysis was done for three and four player games and a comparison was made between the un-normalized method and the re-normalized method. It was found that re-normalization provides a more accurate representation of the classical game and hence can be a better solution for the quantum game.
Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum domain where the linear superposition of actions is allowed. This quantization let us describe and solution problems originated by conflicting or cooperative behaviors among the members of a system from the point of view of quantum mechanical interactions. This leads us to interesting aspects which only can be observed through the quantization of a game like the possibility of the entanglement between players, the definition of a socioeconomical temperature in a system, the collective welfare principle,the analysis of a game through elements of quantum information theory and the globalization process. The relationships between quantum mechanics and game theory are also studied and its shown how although both systems analyzed are described through two theories apparently different (quantum mechanics and game theory) both are analogous and thus exactly equivalents.
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.