Compilation of Qubit Circuits to Optimized Qutrit Circuits
summary
An optimizing compiler called Dare converts qubit circuits into qutrit circuits by a novel qutrit decomposition plus a rewrite engine that applies both strictly equal and relaxed cubit equality rewrites (proved with outer‑product algebra) and a lowering pass to basis gates. On benchmarks Dare reduces depth up to 65% versus manual qutrit implementations and 43–75% versus qubit circuits, cuts gate counts similarly, and reports up to ~9× fidelity improvement over manual qutrits under their noise model.
AI-written summary · about
chapters (13)
- 0:00Qubit to qutrit compilation
- 1:03Higher energy states benefits
- 3:11Dare compiler optimizations
- 4:55Strict vs qubit equality
- 7:45Proving transformations
- 10:55Partitioning large circuits
- 11:39Circuit complexity evaluation
- 13:45Qubit vs qutrit fidelity
- 14:51Future directions
- 15:12Higher-dimensional qudits
- 16:58Arbitrary qutrit states
- 18:22Hand-optimized decompositions
- 20:13Q&A
related talks
24mAdventures in Qutrit Compilation
19mEquality Saturation for Quantum Circuit Optimization
24mSynthesizing Quantum-Circuit Optimizers
26mGenerating Compilers for Qubit Mapping and Routing
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
48mHardware-efficient quantum computing using qudits
19mOptimizing Ancilla-Based Quantum Circuits with SPARE
14mDependency-Aware Compilation for Surface Code Quantum Architectures