Finding the optimal Nash equilibrium in a discrete Rosenthal congestion game using the Quantum Alternating Operator Ansatz

08/20/2020
by   Mark Hodson, et al.
0

This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum computer. The game is of the type originally posited by Rosenthal in the 1970's. To find the optimal Nash equilibrium, we formulate an optimization problem encoding based on potential functions and path selection constraints, and solve it using the Quantum Alternating Operator Ansatz. We compare this formulation to its predecessor, the Quantum Approximate Optimization Algorithm. We implement our solution on an idealized simulator of a gate-model quantum computer, and demonstrate tractability on a small two-player game. This work provides the basis for future endeavors to apply quantum approximate optimization to quantum machine learning problems, such as the efficient training of generative adversarial networks using potential functions.

READ FULL TEXT

page 7

page 8

research
12/20/2021

Calculating Nash equilibrium and Nash bargaining solution on quantum annealers

Adiabatic quantum computing is implemented on specialized hardware using...
research
08/19/2018

Compiling Adiabatic Quantum Programs

We develop a non-cooperative game-theoretic model for the problem of gra...
research
12/04/2020

Entanglement and quantum strategies reduce congestion costs in quantum Pigou networks

Pigou's problem has many applications in real life scenarios like traffi...
research
11/30/2009

A Decision-Optimization Approach to Quantum Mechanics and Game Theory

The fundamental laws of quantum world upsets the logical foundation of c...
research
02/05/2023

A Game-Theoretic Approach to Solving the Roman Domination Problem

The Roamn domination problem is one important combinatorial optimization...
research
07/02/2018

Analysis and Optimization of Deep CounterfactualValue Networks

Recently a strong poker-playing algorithm called DeepStack was published...
research
12/09/2022

Digital quantum simulation of Schrödinger dynamics using adaptive approximations of potential functions

Digital quantum simulation (DQS) of continuous-variable quantum systems ...

Please sign up or login with your details

Forgot password? Click here to reset