arXiv:2609.19485
Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks
Julio C. Magdalena de la Fuente, Thomas R. Scruby
Abstract
Useful quantum computation requires the fault-tolerant implementations of a universal gate set which are generically not efficiently simulable. We devise an algebraic framework that allows for efficient sampling from the measurement distribution of fault-tolerant circuits that implement diagonal logic gates in the third level of the Clifford hierarchy. Upon successful sampling we also provide sufficient conditions for decoding success. The resulting estimate for the logical failure rate is an overestimate, which becomes more accurate for blocks that are fault tolerant against arbitrary local errors. The non-Clifford simulation overhead is independent of the number of logical qubits, making the method particularly attractive for large-scale simulations. The framework is based on viewing the non-Clifford gates in the circuit as a cohomology invariant of an underlying spacetime fault complex. The method can also be interfaced with Clifford simulators to simulate larger fault-tolerant circuits and algorithmic subroutines.
AI Summary
Estimating logical failure rates of non-Clifford fault-tolerant gadgets generally requires more than stabilizer simulation: both measurement sampling and identifying logical errors can be difficult. This paper develops a decoding-focused simulator for blocks composed of CSS operations, diagonal third-level Clifford-hierarchy gates ($T$, $CS$, $CCZ$), and stochastic Pauli faults, without tracking the logical wavefunction. The construction represents the circuit by a spacetime fault complex and a cubic phase function $S$. For the fault-tolerant families considered, $S$ is a local cohomology invariant. Residual $X$ faults modify the constraints on $X$-measurement outcomes, producing “twisted” detectors. Under a contractibility condition C—requiring a filling of the residual fault configuration whose gate-expanded support contains no nontrivial logical cycle—the detector space is $\ker M^b$, where $M^b$ is computed from third derivatives of $S$. The measurement distribution is uniform over an affine subspace. These results yield linear-algebra routines for sampling additional correlated $Z$ errors and testing decoding success through the underlying CSS problem. The non-Clifford simulation overhead has no separate dependence on the number of logical qubits. Pauli-frame interfaces to Clifford simulators are also described. Configurations for which condition C cannot be certified are counted as failures, giving a conservative overestimate. Finding a suitable filling can require exponential work; the general implementation therefore uses an approximate search. No general quantitative tightness bound or runtime benchmark is supplied. Logical-state-dependent measurement outcomes require additional information, and the formalism does not cover arbitrary non-Clifford circuits. Numerical implementation for a structured topological protocol is reported separately.
Central claim may not hold: The paper does not establish a general quantitative or asymptotic guarantee that fault tolerance against arbitrary local errors makes the estimator's conservative rejection bias small. The overview algorithm rejects the true flag that CheckCondC returns for a successful contractibility test, including the empty filling of a noiseless instance. The overview algorithm cancels its sampled twisted error in the final success test and references an undefined measurement variable c_m. GenLinking permits offsets differing by an undetectable logical Z operator, which preserve its syndrome equation but can reverse success classifications, so the stated procedure does not guarantee a conservative logical-failure estimate.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21 pages