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

arXiv:0707.0324 · Springer eBooks

Quantum Nash Equilibria and Quantum Computing

Philip V. Fellman, Jonathan Vos Post

Published Jan 1, 2010• 3 citations
arXivHTMLPDF
DOI
10.1007/978-3-540-85081-6_56

Related papers

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

Entanglement-decoherence-Nash equilibria diagrams in quantum games

Hoor Banu, K. Raghavendra Rao

Physics Letters A•Oct 18, 2023•3 citations

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

Mapping Game Theory to Quantum Systems: Nash Equilibria via Neutral Atom Computing

Giovanni Ferrannini, Dario Di Gregorio, Federico Fissore

Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However, finding Nash equilibria is challenging due to its NP-Hard complexity, specifically within the PPAD class. By exploiting the correspondence between Maximum Independent Sets (MIS) and Nash equilibria on unit-disk graphs, we map these problems onto the ground state configurations of Rydberg atom arrays. Simulations show the effectiveness of this quantum method, highlighting its potential for solving complex problems in game theory.

quant-pharXiv:2511.09841•Nov 14, 2025•0 citations

A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

Christoph Roch, Thomy Phan, Sebastian Feld +4 more

arXiv:1903.06454•Lecture notes in computer science•Jan 1, 2020•6 citations

Quantum Nash equilibrium in the thermodynamic limit

Shubhayan Sarkar, Colin Benjamin

arXiv:1806.07343•Quantum Information Processing•Mar 7, 2019•12 citations
Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However, finding Nash equilibria is challenging due to its NP-Hard complexity, specifically within the PPAD class. By exploiting the correspondence between Maximum Independent Sets (MIS) and Nash equilibria on unit-disk graphs, we map these problems onto the ground state configurations of Rydberg atom arrays. Simulations show the effectiveness of this quantum method, highlighting its potential for solving complex problems in game theory.