Compiling Adiabatic Quantum Programs

2018/08/31 by Faisal Shah Khan, Nada Elsokkary, Travis S. Humble
Computer Science · Physics and Astronomy · #cs.GT #quant-ph

paper · pdf

published as Proceedings of the Workshop on Quantum Communication and Information Technology, IEEE Globecom, 2018 · arXiv admin note: substantial text overlap with arXiv:1801.02053, arXiv:1609.08360, arXiv:1803.07919

arxiv created 2018/09/06 · arxiv updated 2019/03/20

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.

Citations

• Nash embedding and equilibrium in pure quantum states
• No fixed-point guarantee of Nash equilibrium in quantum games
• Quantum games: a review of the history, current state, and interpretation