.png){kind=icon}
Return
Compositional Quantum Control Flow with Efficient Compilation in Qunity
.png){kind=icon}
PRE
AI
DOI：10.1145/3763056.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
quantum programming languages
high-level programming languages
quantum control flow
quantum subroutines
compiler optimizations
Journal
P
IF:
2.8
Papers:
308
Citations:
4.7K
Organization
Cited Papers
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
OAAI
.png){kind=icon}
OAAIShareSaveShareSave
ShareSaveShareSave
View more