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

Physics Letters A

Entanglement-decoherence-Nash equilibria diagrams in quantum games

Hoor Banu, K. Raghavendra Rao

Published Oct 18, 2023• 3 citations
Publisher
DOI
10.1016/j.physleta.2023.129171

Related papers

Entanglement and dynamic stability of Nash equilibria in a symmetric quantum game

Azhar Iqbal, A. H. Toor

arXiv:quant-ph/0101106•Physics Letters A•Jul 1, 2001•28 citations

Nash equilibria in quantum games with generalized two-parameter strategies

Adrian P. Flitney, Lloyd C. L. Hollenberg

arXiv:quant-ph/0610084•Physics Letters A•Nov 28, 2006•91 citations

Characterizing the Nash equilibria of a three-player Bayesian quantum game

Neal Solmeyer, Ricky Dixon, Radhakrishnan Balu

arXiv:1703.03291•Quantum Information Processing•Apr 21, 2017•12 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

Characterizing the Nash equilibria of three-player Bayesian quantum games

Neal Solmeyer, Radhakrishnan Balu

Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria of a variety of two-player quantum games and compare the results to the solutions of the corresponding classical games. We then analyze Bayesian games where there is uncertainty about the player types in two-player conflicting interest games. The solutions to the Bayesian games are found to have a phase diagram-like structure where different equilibria exist in different parameter regions, depending both on the amount of uncertainty and the degree of entanglement. We find that in games where a Pareto-optimal solution is not a Nash equilibrium, it is possible for the quantized game to have an advantage over the classical version. In addition, we analyze the behavior of the solutions as the strategy choices approach an unrestricted operation. We find that some games have a continuum of solutions, bounded by the solutions of a simpler restricted game. A deeper understanding of Bayesian quantum game theory could lead to novel quantum applications in a multi-agent setting.

arXiv:1703.03292•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2017•6 citations

Quantum Nash Equilibria and Quantum Computing

Philip V. Fellman, Jonathan Vos Post

arXiv:0707.0324•Springer eBooks•Jan 1, 2010•3 citations
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.
Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria of a variety of two-player quantum games and compare the results to the solutions of the corresponding classical games. We then analyze Bayesian games where there is uncertainty about the player types in two-player conflicting interest games. The solutions to the Bayesian games are found to have a phase diagram-like structure where different equilibria exist in different parameter regions, depending both on the amount of uncertainty and the degree of entanglement. We find that in games where a Pareto-optimal solution is not a Nash equilibrium, it is possible for the quantized game to have an advantage over the classical version. In addition, we analyze the behavior of the solutions as the strategy choices approach an unrestricted operation. We find that some games have a continuum of solutions, bounded by the solutions of a simpler restricted game. A deeper understanding of Bayesian quantum game theory could lead to novel quantum applications in a multi-agent setting.