Compiling Adiabatic Quantum Programs
Computer Science and Game Theory
2019-03-20 v2 Quantum Physics
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.
Cite
@article{arxiv.1808.06926,
title = {Compiling Adiabatic Quantum Programs},
author = {Faisal Shah Khan and Nada Elsokkary and Travis S. Humble},
journal= {arXiv preprint arXiv:1808.06926},
year = {2019}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1801.02053, arXiv:1609.08360, arXiv:1803.07919