Compiling Adiabatic Quantum Programs

TL;DR

This paper introduces a game-theoretic model for optimizing the compilation of adiabatic quantum programs, demonstrating that Nash equilibrium solutions can be achieved for graph minor-embedding problems.

Contribution

It presents a novel non-cooperative game-theoretic approach to the problem of graph minor-embedding in adiabatic quantum computing, enabling optimal program compilation.

Findings

Optimal compiling in the sense of Nash equilibrium is achievable.

The model provides a new perspective on quantum program compilation.

Game theory can be applied to quantum computing optimization problems.

Abstract

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.