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:1903.06454 · Lecture notes in computer science

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

Christoph Roch, Thomy Phan, Sebastian Feld, Robert Müller, Thomas Gabor, Carsten Hahn, Claudia Linnhoff-Popien

Published Jan 1, 2020• 6 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-50433-5_38

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

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

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

A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games

Christoph Roch, Santiago Londoño Castillo, Claudia Linnhoff–Popien

The Grover algorithm and its underlying amplitude amplification process are one of the most essential and widely used building blocks of many other subsequent quantum methods. In this work, we adapt Grover’s search algorithm to find pure Nash equilibria in graphical games. In general, the main complexity lies in the construction of the algorithm’s oracle operator. We show how to set up the oracle from a given graphical game by translating it to a Boolean satisfiability problem, which can subsequently be logically synthesized to an oracle quantum circuit. We investigate the algorithm for random graphical game instances on IBM’s quantum simulator and give an outlook regarding the scaling of it.

IEEE International Conference on Software Architecture Companion (ICSA-C)•Mar 1, 2022•7 citations

Quantum Nash Equilibria and Quantum Computing

Philip V. Fellman, Jonathan Vos Post

arXiv:0707.0324•Springer eBooks•Jan 1, 2010•3 citations
The Grover algorithm and its underlying amplitude amplification process are one of the most essential and widely used building blocks of many other subsequent quantum methods. In this work, we adapt Grover’s search algorithm to find pure Nash equilibria in graphical games. In general, the main complexity lies in the construction of the algorithm’s oracle operator. We show how to set up the oracle from a given graphical game by translating it to a Boolean satisfiability problem, which can subsequently be logically synthesized to an oracle quantum circuit. We investigate the algorithm for random graphical game instances on IBM’s quantum simulator and give an outlook regarding the scaling of it.