Adventures in Qutrit Compilation
summary
Gives an explicit, ancilla-free construction for any qutrit multiple-controlled Toffoli and shows any Clifford+T qutrit unitary can have arbitrarily many control qutrits added unitarily without ancillae, a property absent for qubits. Constructions compile into the qutrit Clifford+T gate set with polynomial gate count, use ZX-calculus rewrites to synthesize arbitrary diagonal unitaries, and realize several small circuits with low non‑Clifford cost (examples include T-count 3 implementations and unitary CCZ equivalents).
AI-written summary · about
chapters (5)
- 0:00Start
- 3:50for qubits
- 16:11Control gates from phase gadgets
- 17:06Multiple-controlled phase gates
- 18:28Qubit MCT
related talks
20mCompilation of Qubit Circuits to Optimized Qutrit Circuits
16mExtending Gottesman Types Beyond the Clifford Group
29mEfficiently Verifying Quantum Programs with Few T Gates
22mOptimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation
17mToward a Type Theoretic Interpretation of Q# and Statically Enforcing the No Cloning Theorem
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
21mQurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
48mHardware-efficient quantum computing using qudits