Qunity: A Unified Language for Quantum and Classical Computing
summary
Qunity defines a unified syntax where sum types → direct sum implements operator sums, exception-handling → projective measurement expresses measurements, and aliasing induces entanglement lets variable reuse create entangled states while using relevant types to track usage. It leverages the BQP subroutine theorem to build reversible subroutines by uncomputation of "garbage", provides a denotational semantics that guarantees quantum validity, and compiles to OpenQASM with a proof that the design is realizable.
AI-written summary · about
chapters (6)
- 0:00Qunity introduction
- 4:43Quantum subroutines
- 9:13Language design approach
- 14:42Qunity benefits
- 18:45Compiling to circuits
- 23:16Future work
related talks
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
23mA feasible and unitary programming language with quantum control
15mToward A Quantum Programming Language for Higher Level Formal Verification
40mQ# - going beyond quantum circuits
21mQurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
40mDemocratizing quantum formal verification: the path-sum way
21mQuantum and Classical Control (work-in-progress)
30mQuantum Computing for Programming Languages Researchers