Depth-Optimal Quantum Compilation
quant-ph, cs.CC
Submitted: 2026-09-28
Updated: 2026-09-28
Terminology
Sources
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- Assessing requirements to scale to practical quantum advantage
- Time-optimal quantum computation
- Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
- $\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
- Magic state cultivation: growing T states as cheap as CNOT gates
- Efficient Magic State Distillation by Zero-Level Distillation
- Constant-Depth Unitary Preparation of Dicke States
- Catalytic $z$-rotations in constant $T$-depth
- Any Clifford+T circuit can be controlled with constant T-depth overhead
- Quantum Circuits: Fanout, Parity, and Counting
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity