Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation
quant-ph
Submitted: 2026-09-15
Updated: 2026-09-30
Comments: 15+7 pages, 11+2 figures; update acknowledgments, clarify fault distance definition, improve malignant fault configurations figure
Code: https://github.com/timchan0/cliffordea
License: http://creativecommons.org/licenses/by/4.0/
The gist: T-state cultivation is a resource-efficient protocol producing logical T states but recent benchmarks show that its logical error rate is considerably higher than intended i.e.
Terminology
Abstract
T-state cultivation is a resource-efficient protocol producing logical T states but recent benchmarks show that its logical error rate is considerably higher than intended i.e. than S-state cultivation, which is the analogous protocol for producing logical S states. In this paper, we explain this T-S discrepancy by analytically showing, under circuit-level depolarising noise, that distance-3 (-5) T-state cultivation has fault distance 2 (3) due to Pauli hook errors that propagate to coherent Clifford errors after its final double-check circuit; such errors remain Pauli in S-state cultivation, which consequently retains fault distance 3 (5). As part of our analysis we derive a general formula, and an O(n 3) -time algorithm for fixed logical-qubit count, for the acceptance probability of a logical mixed state afflicted with a Clifford error, where n is the physical qubit count. We then design flags that detect the malignant hook errors in cultivation, improving the pre-escape logical error rate from Θ(p 3) to Θ(p 5). At noise level p =10-3, this is a 4.9 times improvement, costing a 1.36 times increase in attempts per accepted shot.
Sources
- Magic state cultivation: growing T states as cheap as CNOT gates
- Cultivating T states on the surface code with only two-qubit gates
- Efficient Magic State Cultivation on the Surface Code
- Cutting stabiliser decompositions of magic state cultivation with ZX-calculus
- Efficient magic state cultivation with lattice surgery
- Magic state cultivation on a superconducting quantum processor
- Constant-depth magic state cultivation with Clifford measurements by gauging
- Efficient Magic State Cultivation for $\sqrt{T}$ Gates
- Batched high-rate logical operations for quantum LDPC codes
- Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC
- Simulating Quantum Error Correction beyond Pauli Stochastic Errors
- Efficient Magic State Factory Via Transversal Non-Clifford Gate
- SOFT: a high-performance simulator for universal fault-tolerant quantum circuits
- Computing logical error thresholds with the Pauli Frame Sparse Representation
- Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
- SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
- Clifford gates with logical transversality for self-dual CSS codes
- Fault tolerance of stabilizer channels
- The Magic Scroll: Leveraging biased noise to improve magic state cultivation in register-based architectures
- SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction
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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians