Calculating Nash equilibrium on quantum annealers

Faisal Shah Khan (), Olga Okrut, Keith Cannon, Kareem H. El-Safty and Nada Elsokkary
Additional contact information
Faisal Shah Khan: Dark Star Quantum Lab
Olga Okrut: Dark Star Quantum Lab
Keith Cannon: Dark Star Quantum Lab
Kareem H. El-Safty: Dark Star Quantum Lab
Nada Elsokkary: Dark Star Quantum Lab

Annals of Operations Research, 2025, vol. 346, issue 2, No 15, 1109-1126

Abstract: Abstract Adiabatic quantum computing is implemented on specialized hardware using the heuristics of the quantum annealing algorithm. To solve a problem using quantum annealing, the problem requires formatting as a discrete quadratic function without constraints. The problem of finding Nash equilibrium in two-player, non-cooperative games is a two-fold quadratic optimization problem with constraints. This problem was formatted as a single, constrained quadratic optimization in 1964 by Mangasarian and Stone. Here, we show that adding penalty terms to the quadratic function formulation of Nash equilibrium gives a quadratic unconstrained binary optimization (QUBO) formulation of this problem that can be executed on quantum annealers. Three examples are discussed to highlight the success of the formulation, and an overall, time-to-solution (hardware + software processing) speed up by seven to ten times is reported on quantum annealers developed by D-Wave System.

Keywords: Nash equilibrium; Quantum annealing; Quantum computing; Quadratic unconstrained binary optimization; Adiabatic quantum computing (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05700-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:346:y:2025:i:2:d:10.1007_s10479-023-05700-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05700-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().