Quick Navigation

Topics

Quantum Error Correction Fault Tolerance

Computing logical error thresholds with the Pauli Frame Sparse Representation

arXiv
Authors: Thomas Tuloup, Thomas Ayral

Year

2026

Paper ID

30798

Status

Preprint

Abstract Read

~2 min

Abstract Words

129

Citations

N/A

Abstract

We introduce a sparse classical representation, a truncation strategy and a shot-efficient sampling method to push the classical prediction of quantum error correction thresholds beyond Clifford operations and Pauli errors. As two illustrations of the potential of our method, we first show that coherent noise error thresholds, when computed at the circuit level (i.e taking into account full syndrome circuits) for distances up to d=9, are systematically overestimated (by a factor of about 4) by a Pauli-twirling approximation of the noise. We then apply our method to the recently introduced magic-state cultivation protocol. We show, through shot-efficient importance sampling, that, at distance d=5, the multiplicative factor between the T-gate and the S-gate injection error rate is not the one conjectured from low-d computations: it can be as large as 7.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #30798 #35400 Building a spin quantum bit reg... #35396 Fault tolerance with noisy and ... #35393 Topological quantum hashing wit... #35390 Clustered error correction of c...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.