Compositional Quantum Control Flow with Efficient Compilation in Qunity
summary
Implementation of the first Qunity compiler that lowers high-level quantum control into OpenQASM 3 and a set of concrete optimizations. Adds two control primitives, match and pmatch, that trade reversible-subroutine capability for simpler typing; implements automatic purification and qubit recycling; applies low-level gate optimizations plus IR-level transformations for direct-sum/pattern matching. Benchmarks report large reductions in qubits and gates, often approaching hand-written circuits, though some complex cases still compile to substantially larger circuits.
AI-written summary · about
chapters (16)
- 0:00Qunity introduction and motivation
- 1:07High-level quantum programming
- 2:11Grover’s algorithm limits
- 4:18Desired quantum abstractions
- 5:22Grover’s iteration syntax
- 6:04Control flow constraints
- 7:31New match and pmatch features
- 8:34Match for subroutines
- 9:15Pmatch for superposition
- 9:57Meta-programming layer
- 10:40Compilation pipeline
- 11:45Initial compilation inefficiencies
- 12:28Optimization techniques
- 13:32Benchmark results
- 13:53Conclusion and future work
- 14:16Q&A
related talks
24mQunity: A Unified Language for Quantum and Classical Computing
39mBuilding a Compiler for Quantum Computers
40mQ# - going beyond quantum circuits
15mToward A Quantum Programming Language for Higher Level Formal Verification
16mOpen Quantum Assembly Language
46mUnlocking quantum potential with software and compilers
20mCompilation of Qubit Circuits to Optimized Qutrit Circuits
26mGenerating Compilers for Qubit Mapping and Routing