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

arXiv:1704.01996 · Quantum Information Processing

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

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

Published Apr 7, 2018• 50 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1863-4

Related papers

Problems of Adiabatic Quantum Program Design

Evgeniya Khusnitdinova, A. C. Cem Say

Lecture notes in computer science•Jan 1, 2006•0 citations

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.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2018•0 citations

Discovering the optimal schedule for adiabatic quantum computation

Research outreach•Jun 1, 2022•0 citations

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

Code Optimization in Quantum Compilation Using Large Language Models

Hamza Arab, Lotfi Djeghri

•Jul 2, 2026•0 citations

Quantum Computing Program Compilation and Optimization Theory

Jincheng Zhang

This paper presents a novel theory for quantum computing program compilation and optimization. The core of this theory lies in translating high-level quantum programs into efficient quantum circuit implementations. This is achieved through the utilization of an abstract syntax tree (AST) derived from the quantum program. A compilation algorithm is designed to traverse the AST and generate corresponding quantum circuits, incorporating optimization strategies throughout the process. The work addresses a significant challenge within quantum computing – the complexity of program compilation – and proposes a new theoretical framework to facilitate the development of more practical and performant quantum algorithms. The theoretical framework outlined here provides a foundation for future research and development in quantum compiler design.

•Aug 29, 2026•0 citations
This paper presents a novel theory for quantum computing program compilation and optimization. The core of this theory lies in translating high-level quantum programs into efficient quantum circuit implementations. This is achieved through the utilization of an abstract syntax tree (AST) derived from the quantum program. A compilation algorithm is designed to traverse the AST and generate corresponding quantum circuits, incorporating optimization strategies throughout the process. The work addresses a significant challenge within quantum computing – the complexity of program compilation – and proposes a new theoretical framework to facilitate the development of more practical and performant quantum algorithms. The theoretical framework outlined here provides a foundation for future research and development in quantum compiler design.