The MQT Compiler Collection: A Blueprint for a Future-Proof Quantum-Classical Compilation Framework
arXiv QuantumArchived Apr 13, 2026✓ Full text saved
arXiv:2604.08674v1 Announce Type: new Abstract: As the capabilities of quantum computing hardware continue to rise, algorithms that exploit them are becoming increasingly complex. These developments increase the need for sophisticated compilation frameworks that translate high-level algorithms into executable code. In the past, most solutions were built with a quantum-first approach and handled mostly pure quantum programs without classical elements such as structured control flow. However, deve
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 9 Apr 2026]
The MQT Compiler Collection: A Blueprint for a Future-Proof Quantum-Classical Compilation Framework
Lukas Burgholzer, Daniel Haag, Yannick Stade, Damian Rovara, Patrick Hopf, Robert Wille
As the capabilities of quantum computing hardware continue to rise, algorithms that exploit them are becoming increasingly complex. These developments increase the need for sophisticated compilation frameworks that translate high-level algorithms into executable code. In the past, most solutions were built with a quantum-first approach and handled mostly pure quantum programs without classical elements such as structured control flow. However, developments in quantum algorithms, error correction, and optimization, as well as the integration into high-performance computing (HPC) environments, depend on such classical elements. As quantum-first approaches increasingly struggle to handle these concepts, classical-first approaches are becoming a promising alternative. In this work, we present the MQT Compiler Collection, a blueprint for a future-proof quantum-classical compilation framework built on the Multi-Level Intermediate Representation (MLIR). After years of experience with the quantum-first approach and its shortcomings, we propose a framework that embraces core MLIR concepts to support the full compilation pipeline from high-level algorithms to hardware-specific instructions. The proposed architecture is designed from the ground up to support complex optimizations beyond, e.g., simple gate cancellation. It is publicly available at this https URL.
Comments: 7 pages, 3 figures, to be presented at Design, Automation & Test in Europe 2026
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2604.08674 [quant-ph]
(or arXiv:2604.08674v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.08674
Focus to learn more
Submission history
From: Daniel Haag [view email]
[v1] Thu, 9 Apr 2026 18:05:10 UTC (1,672 KB)
Access Paper:
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-04
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)