Exact T-counts of CCZ layers from an isotropy bound
quant-ph, cs.CC
Submitted: 2026-10-01
Updated: 2026-10-04
Code: https://github.com/khoruzhii/bcf10
Terminology
Sources
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- An algorithm for the T-count
- Optimising quantum circuits is generally hard
- T-count and T-depth of any multi-qubit unitary
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Quantifying magic for multi-qubit operations
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Stabilizer R'enyi entropy
- Amortized Stabilizer R'enyi Entropy of Quantum Dynamics
- A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
- Characterization of permutation gates in the third level of the Clifford hierarchy
- Quantum Circuit Optimization with AlphaTensor
- An Efficient Quantum Compiler that reduces $T$ count
- PyZX: Large Scale Automated Diagrammatic Reasoning
- Reducing T-count with the ZX-calculus
- Halving the cost of quantum addition
- Semi-Clifford operations, structure of $\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
- C3, Semi-Clifford and Generalized Semi-Clifford Operations
- A new quantum ripple-carry addition circuit
- Halving the cost of QROM
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