Compiling Conditional Quantum Gates without Using Helper Qubits
summary
Compiles an n‑qubit conditional into a linear number of two‑qubit conditionals without helper qubits, using 278n gates overall and empirically requiring 1/3 as many gates as the previous best helper‑free scheme (vs 822), reducing compiled circuit size by about 34% for 8+ qubits. Seven optimizers (including VQC) fail to shrink the old scheme down to these sizes, but running optimizers on this new output trims the constant to ~228 and raises Grover and quantum‑walk reliability.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 1:45Challenge of conditional gates
- 3:32Linear compilation scheme
- 7:23Generalizing to N qubits
- 8:05Experimental results
- 11:18Conclusion
- 11:41Q&A
related talks
32mOptimal Quantum Programs
15mAssertion-Based Optimization of Quantum Programs
22mOptimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation
24mSynthesizing Quantum-Circuit Optimizers
39mBuilding a Compiler for Quantum Computers
37mResource-Efficient Quantum Computing by Breaking Abstractions
19mOptimizing Ancilla-Based Quantum Circuits with SPARE
14mDependency-Aware Compilation for Surface Code Quantum Architectures