Compositional Quantum Control Flow with Efficient Compilation in Qunity
- URL: http://arxiv.org/abs/2508.02857v1
- Date: Mon, 04 Aug 2025 19:32:13 GMT
- Title: Compositional Quantum Control Flow with Efficient Compilation in Qunity
- Authors: Mikhail Mints, Finn Voichick, Leonidas Lampropoulos, Robert Rand,
- Abstract summary: We focus on the efficient compilation of high-level quantum control flow constructs using Qunity.<n>We create a complete implementation of a Qunity compiler, which converts high-level Qunity code into the quantum assembly language OpenQASM 3.
- Score: 0.2796197251957244
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Most existing quantum programming languages are based on the quantum circuit model of computation, as higher-level abstractions are particularly challenging to implement - especially ones relating to quantum control flow. The Qunity language, proposed by Voichick et al., offered such an abstraction in the form of a quantum control construct, with great care taken to ensure that the resulting language is still realizable. However, Qunity lacked a working implementation, and the originally proposed compilation procedure was very inefficient, with even simple quantum algorithms compiling to unreasonably large circuits. In this work, we focus on the efficient compilation of high-level quantum control flow constructs, using Qunity as our starting point. We introduce a wider range of abstractions on top of Qunity's core language that offer compelling trade-offs compared to its existing control construct. We create a complete implementation of a Qunity compiler, which converts high-level Qunity code into the quantum assembly language OpenQASM 3. We develop optimization techniques for multiple stages of the Qunity compilation procedure, including both low-level circuit optimizations as well as methods that consider the high-level structure of a Qunity program, greatly reducing the number of qubits and gates used by the compiler.
Related papers
- Quantum circuits are just a phase [0.0]
We introduce a novel quantum programming language for generating unitaries from "just a phase"<n>This minimal language lifts the focus from quantum gates to eigendecomposition, conjugation, and controlled unitaries.
arXiv Detail & Related papers (2025-07-15T19:31:53Z) - Unitary Expressions: A Necessary Abstraction for Extensible Quantum Programming Languages and Systems [0.21756081703276003]
We introduce the OpenQudit system for describing, parsing, optimizing, analyzing, and utilizing programs comprising gates described as symbolic unitary expressions.<n>QGL is a unitary-specific expression language, and implement a differentiating just-in-time compiler in OpenQudit.<n>Our QVM can compute approximately ten times faster than current leading numerical quantum compilation frameworks.
arXiv Detail & Related papers (2025-01-16T17:05:41Z) - ONDA: A High-Level Quantum Programming Language with Sequential Execution and Conditional Branching [0.0]
ONDA is a quantum programming language designed to significantly simplify quantum programming.<n>ONDA compiles into quantum instructions executed autonomously by specialized quantum hardware.<n>By leveraging a quantum microarchitecture that autonomously processes compiled instructions, ONDA facilitates the intuitive implementation of high-level quantum algorithms.
arXiv Detail & Related papers (2024-10-09T11:16:29Z) - Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers [0.52197339162908]
We introduce Qrisp, a framework designed to bridge several gaps between high-level programming paradigms and quantum hardware.
Qrisp's standout feature is its ability to compile programs to the circuit level, making them executable on most existing physical backends.
arXiv Detail & Related papers (2024-06-20T23:40:22Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Quantum Control Machine: The Limits of Control Flow in Quantum Programming [9.481014977048282]
We provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer.
We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
arXiv Detail & Related papers (2023-04-28T17:51:35Z) - Qunity: A Unified Language for Quantum and Classical Computing (Extended Version) [3.862247454265945]
We introduce Qunity, a new quantum programming language.<n>Qunity treats quantum computing as a natural generalization of classical computing.<n>We show how Qunity can cleanly express several quantum algorithms.
arXiv Detail & Related papers (2022-04-26T15:34:22Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
We devise three effective QAE-based learning protocols to address three classically computational hard learning problems.
Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum
Simulation [48.341084094844746]
We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation.
We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
arXiv Detail & Related papers (2021-05-17T16:17:57Z) - Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation.
We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
arXiv Detail & Related papers (2021-01-20T14:20:14Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z) - Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context.
Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
arXiv Detail & Related papers (2020-10-08T12:49:07Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.