Preparing logical codewords with a single round of noisy syndrome measurements can reduce the time overhead of fault-tolerant quantum computation. It remains unclear which structural properties of the code suffice to guarantee a threshold for single-shot state preparation. Here we prove that linear confinement suffices for a nonzero single-shot state-preparation threshold for CSS quantum low-density parity-check codes, in contrast to the common belief that soundness is necessary. When the distance is at least logarithmic, we prove that below nonzero local stochastic readout and data error thresholds, the logical error probability after a formal ideal final recovery is exponentially small and approaches zero when the code size approaches infinity. Under the stronger assumption of linear soundness, we show that the residual data error of the preparation protocol is local stochastic, directly allowing composition with other fault-tolerant gadgets. To investigate single-shot state-preparation threshold beyond the above assumptions, we further develop a statistical mechanical mapping that expresses the final logical error rate in terms of a classical partition function. We perform Monte Carlo simulations of this model for the three-dimensional toric code. The numerical results suggest that sublinear soundness can also support a single-shot state-preparation threshold.
We first provide a simple proof showing that any single-shot code is self-correcting. We then show that any
[[n,k]] CSS quantum low-density parity-check (QLDPC) code can be transformed into an
[[nm,k]] CSS QLDPC code with single-shot (SS) quantum error correction and an efficient local decoder which runs in
O(logm) parallel time. Below a constant threshold
pRG>0 for joint local stochastic physical and measurement noise, the logical failure probability over
T correction rounds is bounded by \begin{equation*}
O(T n)\exp[-Ω(m^α)] \end{equation*} for a constant
α>0; we say that the \textit{threshold} is
pRG and \textit{error suppression} is
Ω(mα). Moreover, if the input code is equipped with a single-shot decoder with threshold
pc>0 and error suppression
Ω(nβ), then the output code \textit{enhances} the error suppression to
Ω(mαnβ), while maintaining the decoder-independent threshold
pRG, and thus \textit{enhanced} if
pc<pRG.
A key appeal of quantum low-density parity check (qLDPC) codes is their ability to suppress stochastic Pauli noise below nonzero thresholds. Coherent errors are fundamentally different: they produce superpositions of error patterns whose amplitudes can interfere even after syndrome measurement. Rigorous understanding of coherent errors remains limited. Here we show that general qLDPC codes admit a nonzero code capacity threshold against local coherent noise and more generally local channel noise. For any family of qLDPC codes with distance
d=Ω(logn), we show that there is a constant noise strength below which the logical recovery error in diamond distance decays exponentially with the code distance. The result is established for optimal recovery as well as the minimum-weight decoder. The key technical ingredient is what we call a \emph{cluster resummation}: rather than bounding superposed error configurations one by one, we isolate a large connected error cluster in the channel expansion and exactly resum all errors disconnected from it before taking norms. Standard cluster counting then yields exponential suppression. This work resolves a longstanding challenge in fault tolerance theory, providing general robustness guarantees for qLDPC codes against coherent noise and laying a rigorous foundation for future studies of fault-tolerant quantum technologies.
Quantum low-density parity-check (QLDPC) codes promise scalable quantum memories, but their decoders receive only sparse check outcomes that may themselves be wrong. We prove that one such record supports logical list decoding near the Singleton radius in a fixed folded-block metric. For any fixed rate and positive gap below that radius, we construct bounded-locality Calderbank--Shor--Steane (CSS) QLDPC families with a randomized near-linear-time decoder. The decoder returns a constant number of Pauli candidates, independent of blocklength. An exact record gives zero-residual coverage of every compatible logical class within the target radius. If an adversarial fraction below a fixed threshold of outcomes is faulty, every compatible error within that radius has stabilizer-reduced relative distance at most a constant times that fraction from some returned candidate. The main advance is to reduce the high-weight logical ambiguity before residual correction begins. Each local syndrome outcome cuts the error space to an affine slice. We prove the quotient-compatibility conditions that let the published Alon--Edmonds--Luby (AEL) average-radius bound control distinct logical classes, leaving only a constant number of alternatives. We then turn the observed slices into the agreement graphs used by fast regularity enumeration. An existing single-shot quantum-Tanner decoder handles the small remainder. The resulting front end preserves the sparse measurement record, and its residual grows linearly with syndrome corruption below the stated threshold.
Recent work established that, for independent erasures, storing
K logical qubits for
S time steps with error at most
ε requires a spacetime cost of
Ω(S(K+log(S/ε))). A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be achieved with an explicit noisy error-correction circuit and efficient decoding, counting all state-preparation, gate, measurement, and wait locations, provided that the hardware supports long-range qubit connectivity and fast, reliable classical processing. Thus, reliability adds only a logarithmic overhead shared by all stored qubits. The construction works for sufficiently weak but otherwise general circuit noise, including faults during syndrome extraction and correlated faults, and for independent erasures it matches the best known lower bound up to constant factors. We attain this scaling using quantum Tanner codes, with each memory step consisting of one round of syndrome extraction followed by a fixed number of parallel classical decoder steps that reduce the residual error enough to keep later faults correctable, regardless of memory size, storage time, or target accuracy. Together, this gives exponentially small failure probability per step while keeping the cost of each memory step linear in the code size. The same analysis also extends to certain constant-depth logical Clifford operations.
Abstract Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group
G and two subsets of
G whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find
[[60,4,10]],[[36,6,6]],[[48,8,6]], and
[[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with
kd>n.
Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of
0.2%, approximately matching that of the
[[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.