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

Acta Informatica

Compiling quantum programs

Paolo Zuliani

Published May 24, 2005• 27 citations
Publisher
DOI
10.1007/s00236-005-0165-3

Related papers

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

Quantum Programming Environment

Jarosław Adam Miszczak

Synthesis lectures on quantum computing•Jan 1, 2012•0 citations

Parallel quantum programs

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations

Compilation Strategies for Quantum Network Programs Using Qoala

Samuel Oslovich, Bart van der Vecht, Stephanie Wehner

Execution of quantum network applications requires a software stack for nodes. Recently, the first designs and demonstrations have been proposed for such software stacks, including QNodeOS and its extension, Qoala. The latter enables compilation strategies previously not possible in QNodeOS. Here, we show how the extensions provided by Qoala can be used by a compiler to improve the performance of quantum network applications. We define new compilation strategies that allow the compiler to influence the scheduling and execution of quantum programs on a quantum network node. Through simulation, we demonstrate that our compilation strategies can reduce the execution time by up to 29.53% and increase the success probability by up to 25.12%. Our work highlights the potential of compiler optimizations for quantum network programs.

arXiv:2505.06162•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•5 citations

Tools for Quantum Programming: A Review

Luciano Marrero, Verena Olsowy, Juan Fernández Sosa +4 more

Communications in computer and information science•Oct 1, 2025•0 citations

pfoqcompiler: Efficient Compilation of Quantum Control in Recursive First-Order Quantum Programs

Mário Silva, Alexandre Guernut, Marco Lewis

This is an artifact for the paper "pfoqcompiler: Efficient Compilation of Quantum Control in Recursive First-Order Quantum Programs". pfoqcompiler is a compiler for First-Order Quantum (FOQ) programs that outputs Qiskit circuits, implementing the 'anchoring and merging' compilation technique and including static analysis tools that ensure complexity bounds on circuit size and depth.

•Sep 3, 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.
Execution of quantum network applications requires a software stack for nodes. Recently, the first designs and demonstrations have been proposed for such software stacks, including QNodeOS and its extension, Qoala. The latter enables compilation strategies previously not possible in QNodeOS. Here, we show how the extensions provided by Qoala can be used by a compiler to improve the performance of quantum network applications. We define new compilation strategies that allow the compiler to influence the scheduling and execution of quantum programs on a quantum network node. Through simulation, we demonstrate that our compilation strategies can reduce the execution time by up to 29.53% and increase the success probability by up to 25.12%. Our work highlights the potential of compiler optimizations for quantum network programs.