Compiling Adiabatic Quantum Programs
classification
💻 cs.GT
quant-ph
keywords
adiabaticcompilingprogramsquantumdevelopequilibriumgame-theoreticgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.