Exact logical error rates for magic state cultivation
quant-ph
Submitted: 2026-09-16
Updated: 2026-09-29
Comments: v3 - expanded section on Pauli semiwebs and implementation available at: https://github.com/kh428/exact_ler_for_msc
Code: https://github.com/mjsutcliffe99/ParamZX
License: http://creativecommons.org/licenses/by/4.0/
The gist: We compute exactly the acceptance and logical error rates for the distance d=3 and d=5 magic state cultivation circuits from Clifft [arXiv:2604.27058] and SOFT [arXiv:2512.23037] using Pauli
Terminology
Abstract
We compute exactly the acceptance and logical error rates for the distance d=3 and d=5 magic state cultivation circuits from Clifft [arXiv:2604.27058] and SOFT [arXiv:2512.23037] using Pauli propagation and binary tensor contraction. Actual T-gates are studied, not the S-gate proxy used for sampling. The calculation includes every fault order at several circuit-level noise strengths (p). We provide a series expansion form to the logical error rates, through order (p/(1-p)) 10. The analytical results recover the numerical values from Clifft and SOFT at both d=3 and d=5 to within their sampling uncertainty. Then, we show that the d=3 and d=5 circuits actually have fault distances of d fault=2 and d fault=3 respectively, explaining the similar distance degrading effects from the companion code of [Quantum 10, 2134 (2026)].
Sources
- Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
- SOFT: a high-performance simulator for universal fault-tolerant quantum circuits
- Handbook of Error-Correcting Codes
- Classical surrogate simulation of quantum systems with LOWESA
- Classical simulations of noisy variational quantum circuits
- Computing logical error thresholds with the Pauli Frame Sparse Representation
- SyQMA: A memory-efficient, symbolic and exact universal simulator for quantum error correction
- Magic state cultivation on a superconducting quantum processor
- Tsim: Fast Universal Simulator for Quantum Error Correction
- Magic state cultivation: growing T states as cheap as CNOT gates
- SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
- Pauli Propagation: A Computational Framework for Simulating Quantum Systems
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