Compiling Adiabatic Quantum Programs

08/19/2018

∙

We develop a non-cooperative game-theoretic model for the problem of graph minor-embedding to show that optimal compiling of adiabatic quantum programs in the sense of Nash equilibrium is possible.

READ FULL TEXT

Compiling Adiabatic Quantum Programs

Quantum Nash equilibrium in the thermodynamic limit

A Decision-Optimization Approach to Quantum Mechanics and Game Theory

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

Generalized Nash Equilibrium Models for Asymmetric, Non-cooperative Games on Line Graphs: Application to Water Resource Systems

Responsive Equilibrium for Self-Adaptive Ubiquitous Interaction

Entanglement and quantum strategies reduce congestion costs in quantum Pigou networks

Building social networks under consent: A survey

Compiling Adiabatic Quantum Programs

Related Research

Quantum Nash equilibrium in the thermodynamic limit

A Decision-Optimization Approach to Quantum Mechanics and Game Theory

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

Generalized Nash Equilibrium Models for Asymmetric, Non-cooperative Games on Line Graphs: Application to Water Resource Systems

Responsive Equilibrium for Self-Adaptive Ubiquitous Interaction

Entanglement and quantum strategies reduce congestion costs in quantum Pigou networks

Building social networks under consent: A survey