Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Globecom Workshops (GC Wkshps)

Compiling Adiabatic Quantum Programs

Faisal Shah Khan, Nada Elsokkary, Travis S. Humble

Published Dec 1, 2018• 0 citations
Publisher

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.
DOI
10.1109/glocomw.2018.8644460

Related papers

Compiling Adiabatic Quantum Programs

Faisal Shah Khan, Nada Elsokkary, Travis S. Humble

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.

arXiv:1808.06926•Aug 19, 2018•1 citation

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble

arXiv:1704.01996•Quantum Information Processing•Apr 7, 2018•50 citations

Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design

Vicky Choi

arXiv:1001.3116•Quantum Information Processing•Oct 13, 2010•278 citations

Adiabatic quantum programming: minor embedding with hard faults

Christine Klymko, Blair D. Sullivan, Travis S. Humble

Quantum Information Processing•Nov 19, 2013•99 citations

Nash Embedding and Equilibrium in Pure Quantums States

Faisal Shah Khan, Travis S. Humble

With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.

•Aug 1, 2018•0 citations

Optimal quantum data classification

Faisal Shah Khan

The problem of simultaneously distinguishing a pure quantum state, generated by some quantum mechanical process, from its constituent observable states optimally is introduced and solved using a non-cooperative game model and the affiliated solution concept of Nash equilibrium. The notion of Nash equilibrium quantum states is introduced and used to classify quantum data optimally.

arXiv:1502.06215•Feb 22, 2015•1 citation
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. We show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.