Single-Shot Decoding in Error Correction

• Single-shot decoding is a paradigm where all necessary decoding information is extracted in one round, eliminating the need for repeated measurements.
• It leverages built-in syndrome redundancy, such as metachecks, and advanced algorithms like belief propagation to simultaneously correct data and measurement errors.
• This approach reduces latency and resource overhead but requires strict code design trade-offs, affecting effective error-correction distances in both quantum and classical channels.

Single-shot decoding is a general paradigm in error correction and information theory in which all information required for decoding—whether for recovering a classical message in communication, or for correcting quantum data and measurement errors in quantum error correction—is acquired in a single round of (potentially noisy) measurement or channel usage, without recourse to temporal repetition or multiple measurement rounds. This contrasts strikingly with traditional multi-shot (repetition-based) protocols, where repeated measurements or channel uses are essential for overcoming noise. Across quantum LDPC codes, classical and quantum channel coding, and even structured-light 3D imaging, single-shot decoding imposes stringent design requirements on code structure and decoding algorithms but delivers reduced latency, lower time overhead, and enables fault tolerance in measurement-limited or latency-critical architectures.

1. Definition and Scope of Single-Shot Decoding

In quantum error correction, single-shot decoding refers to the capability of certain codes and decoders to infer both data errors and syndrome (measurement) errors from a single, noisy syndrome record, without repeating the stabilizer measurements over multiple cycles. Formally, for a quantum LDPC code with parity-check matrix $H$ and measured syndrome $s = H e + u$ (where $e$ is the data error and $u$ is the measurement fault vector), single-shot decoding requires that a decoder outputs a pair $(\tilde{e}, \tilde{u})$ such that $H \tilde{e} + \tilde{u} = s$, and such that the residual error $r = e + \tilde{e}$ has weight that is at most a constant times $|u|$ (Huang et al., 2023, Gu et al., 2023, Higgott et al., 2022). Analogously, in classical and quantum channel coding, single-shot (or one-shot) decoding asks for encoding/decoding protocols that operate reliably in a single use of a channel, regardless of memorylessness, and subject to desired error and information constraints (Liu, 24 Nov 2025, Wilde, 2013).

Single-shot decoding has been demonstrated in several prominent settings:

• Quantum LDPC codes with explicit syndrome redundancy and meta-syndrome constraints (“metachecks”) (Campbell, 8 Sep 2025, Breuckmann et al., 2020, Higgott et al., 2022).
• Classical and quantum communication settings via information-theoretic one-shot achievability, sometimes realized through Poisson functional representation and sequential decoders (Liu, 24 Nov 2025, Wilde, 2013).
• Classical neural or structured-light signal reconstruction, where all correspondence information is extracted in a single measurement (Li et al., 16 Dec 2025).

2. Structural Pre-requisites for Single-Shot Decoding

The main requirement for single-shot decodability is sufficient structural redundancy among the syndromes to distinguish measurement errors from data errors without recourse to time-domain repetition. In CSS quantum codes, this commonly takes the form of "metachecks"—additional LDPC parity constraints among the syndrome bits themselves—such that all valid, error-free syndromes lie in the null space of an auxiliary parity-check matrix $M$ (Berent et al., 2023, Campbell, 8 Sep 2025). That is, the code is single-shot if there exists $M$ such that $M (H e) = 0$ for all physical errors $e$, and $M$ itself has strong distance and LDPC properties.

The classical syndrome code associated to each Pauli type determines the syndrome error-tolerance of the single-shot decoder. The syndrome code distance $d_S$ directly sets the number of measurement errors correctable in a single round, with guaranteed correction up to $\lfloor (d_S-1)/2 \rfloor$ syndrome faults (Rowshan, 3 Jan 2026, Lin et al., 26 Feb 2025). The quantum code’s data distance $d$ generally bounds the number of data errors correctable, but under single-shot operation the effective distance $d_\mathrm{eff} \le d$ may be significantly reduced due to error propagation from single-round measurement faults (Huang et al., 2023, Lin et al., 26 Feb 2025).

For quantum LDPC codes of group-theoretic type (e.g., bivariate/bicycle, GB, or hypergraph product codes), the algebraic properties of the generating polynomials or chain complex determine both the quantum rate, distance, and stabilizer redundancy. Notably, in BB codes, the gcd polynomial $g(z)$ simultaneously determines the logical dimension and the syndrome code, yielding a direct algebraic "rate–redundancy equality" that constrains maximum achievable single-shot tolerance at fixed rate (Rowshan, 3 Jan 2026).

3. Single-Shot Decoding Algorithms

Quantum LDPC Codes

Meta-Syndrome Decoding (CSS Codes):

For codes equipped with syndrome redundancy (metachecks), single-shot decoding typically proceeds by constructing an augmented parity-check matrix

$$H_\mathrm{single} = \begin{pmatrix} H & I \ 0 & M \end{pmatrix},$$

and solving jointly for the minimal-weight pair (data error, syndrome error) consistent with measured syndrome and meta-constraints (Berent et al., 2023, Campbell, 8 Sep 2025). Practical decoding often employs belief-propagation (BP) on the Tanner graph or BP augmented by ordered-statistics decoding (OSD), sometimes in a single stage (joint data and syndrome inference) or two-stage (first syndrome error correction, then data error decoding) pipeline (Higgott et al., 2022, Huang et al., 2023).

Cellular Automaton (CA) and Local Decoders:

For 4D hyperbolic codes and high-dimensional toric codes, local parallelizable decoders (e.g., majority-vote cellular automata) exploit the local constraint structure to achieve efficient, single-shot operation, converging in time $O(d)$ (Breuckmann et al., 2020).

Homological and Shadow Decoders:

Decoders based on the geometric confinement property (see Section 4) operate in two stages: (i) syndrome repair to repair measurement errors using the syndrome code's redundancy, and (ii) minimum-weight decoding of the corrected syndrome (Quintavalle et al., 2020).

Classical and Quantum Channel Coding

Sequential Decoding:

One-shot channel coding capacity and error bounds are achieved via sequential decoder constructions, relying on tests (POVMs or classical likelihood checks) for each message in turn and leveraging sharp non-commutative union bounds to ensure low error rates in a single channel use (Wilde, 2013, Liu, 24 Nov 2025).

Poisson Functional Representation:

In classical one-shot information theory, the Poisson functional representation and Poisson matching lemma provide universal schemes that achieve optimal one-shot achievability results for source and channel coding (Liu, 24 Nov 2025).

3D Imaging and Signal Processing

Neural or Cost-Volume Single-Shot Decoding:

Single-shot depth imaging leverages neural feature matching from a solitary active projection (e.g., IR pattern) and a passive infrared or stereo pair, constructing learned cost volumes over candidate disparities and exploiting geometric priors to produce dense correspondences in one pass (Li et al., 16 Dec 2025).

4. Code Design, Effective Distance, and Performance Tradeoffs

Single-shot capability is tightly linked to code structure. In LDPC codes, code families such as quantum Tanner codes (Gu et al., 2023), bivariate bicycle codes (Rowshan, 3 Jan 2026), general GB codes (Lin et al., 26 Feb 2025), and trivariate tricycle codes (Jacob et al., 11 Aug 2025) achieve (partial) single-shot decodability through built-in stabilizer redundancy. However, the maximal single-shot correctable syndrome error rate is limited by the syndrome code distance, which is often upper bounded in terms of the code's quantum rate (Singleton–type bounds); e.g., in bivariate bicycle codes with rate $R$, the max single-shot correctable syndrome weight scales as $O(R n/2)$.

The effective code distance $d_\mathrm{eff}$ achieved in single-shot operation may be lower than the code distance $d$, since measurement errors can induce correlated residual errors of size $O(|u|)$. Empirically, effective suppression of logical errors under single-shot decoding can require larger codes or reduced rate to match multi-shot performance, especially in homological product and hypergraph product codes (Huang et al., 2023, Higgott et al., 2022, Lin et al., 26 Feb 2025). This motivates sliding-window and quasi-single-shot protocols, which trade fixed small windows of repeated measurements for improved $d_\mathrm{eff}$ without recovering full multi-shot latency overhead (Huang et al., 2023, Berent et al., 2023, Lin et al., 26 Feb 2025, Lin et al., 25 Nov 2025).

In physical implementation, circuit-level fault models further restrict achievable thresholds, particularly when high-weight checks are required. Recent advances in local patch-based single-shot checks on toric codes have enabled substantial measurement-round reductions at modestly enlarged check weight, with threshold scaling and optimal window size now determined by patch width (Lin et al., 25 Nov 2025).

5. Thresholds, Numerical Benchmarks, and Practical Implications

Recent theoretical and numerical studies have established single-shot logical error thresholds in various code families:

Code Family / Setting	Single-Shot Threshold	Code Rate	Key Reference
3D toric (phenomenol. noise)	2.90%	O(1/L)	(Quintavalle et al., 2020)
3D surface (phenomenol. noise)	3.08%	O(1/L)	(Quintavalle et al., 2020)
4D hyperbolic LDPC	~4%	0.18 (asymptotic)	(Breuckmann et al., 2020)
HGP codes (4D, BP+OSD)	4.3% (full) / 7.1% (3D, Z-only)	O(1)	(Higgott et al., 2022)
Bosonic-QLDPC (analog)	9.9%	code-dependent	(Berent et al., 2023)
Tricycle codes (TT, Z, circ.)	~1.06% (Z), 0.3% (X)	O(n^{-1})–O(n^{-0.5})	(Jacob et al., 11 Aug 2025)

Sliding-window and quasi-single-shot variants further enable near-single-shot performance at reduced window sizes, with logical error rates that saturate at $w \sim d_S$ (Huang et al., 2023, Berent et al., 2023, Lin et al., 26 Feb 2025).

Single-shot decoding underpins quantum architectures targeting minimal QEC time overhead (e.g., using QPU–CPU orchestrated controls (Campbell, 8 Sep 2025)) and enables resource-limited or high-latency applications, such as low-latency wireless communication (polar codes (Song et al., 2023)), low-latency quantum memory, and next-generation imaging sensors (Li et al., 16 Dec 2025).

6. Fundamental Limitations and Design Bottlenecks

The principal bottleneck for single-shot decoding is the trade-off between quantum rate and syndrome error tolerance. In group-algebraic LDPC codes, BCH and Singleton bounds constrain the syndrome code distance and hence the maximum correctable measurement error in one round, often scaling as $O(\sqrt{n})$ or lower for nontrivial rates (Rowshan, 3 Jan 2026). In effect, increasing quantum rate or decreasing stabilizer redundancy reduces single-shot tolerance. For some subsystem codes and partial single-shot architectures, metachecks may exist only in one basis, yielding "partial single-shot decodability" (e.g., tricycle codes (Jacob et al., 11 Aug 2025)).

Furthermore, for 2D topological codes, local check structure precludes true single-shot decodability, as measurement errors may be indistinguishable from data errors without extended space-time correlations; mitigation is possible via dynamic patch-based local checks or by adopting higher-dimensional codes (Lin et al., 25 Nov 2025).

Finally, while sequential decoders for single-shot communication are information-theoretically optimal, constructing efficient decoders with minimal quantum disturbance and feasible computational complexity remains a subject of active study (Wilde, 2013).

7. Future Directions and Open Problems

Key open research frontiers include:

• Extending single-shot decodability to broader families of LDPC codes and network quantum channels through novel syndrome code constructions and multi-sender decoupling (Gu et al., 2023, Chakraborty et al., 2021).
• Pushing the algebraic bounds on syndrome distance, particularly for high-rate, low-overhead codes, and optimizing the redundant stabilizer design to maximize single-shot capacity (Rowshan, 3 Jan 2026, Lin et al., 26 Feb 2025).
• Developing efficient, scalable joint decoders for large-scale codes that avoid the effective distance drop often seen in naive single-shot schemes, possibly leveraging neural decoders and analog syndrome information (Berent et al., 2023, Song et al., 2023).
• Determining optimal tradeoffs between spatial and temporal redundancy, leveraging patch-local and dynamically scheduled checks, especially in topological and surface-code-inspired architectures (Lin et al., 25 Nov 2025).
• Systematically characterizing the information-theoretic one-shot capacity of quantum and classical channels, including multi-user and network models, within finite blocklength and resource-limited regimes (Liu, 24 Nov 2025, Chakraborty et al., 2021).
• Elucidating the full impact of analog or soft-decision information for practical single-shot decoders in both classical and quantum contexts (Berent et al., 2023).
• Extending single-shot fault tolerance to logical gate operations, as in the single-shot implementation of transversal gates in tricycle codes (Jacob et al., 11 Aug 2025) and developing syndrome-extraction circuits optimized for minimal time and latency overhead.

Single-shot decoding thus provides a unifying conceptual and practical framework for low-latency, resilient error correction and communication, grounded in a detailed interplay of code structure, decoder design, and the fundamental constraints imposed by noisy measurements or channel uses.