Skip to content
Preprint

Reducing Decoding Latency in Quantum Error Correction by Early Starting Clustering

Sep 2026 · 0 citations · 63 references
Physics

TL;DR

Cluster-As-You-Go (CAYG), a modification of the Union-Find decoder that processes syndrome information during stabilizer measurements by clustering and correcting errors as they appear, is introduced, demonstrating that real-time, early-starting decoding during QEC cycles is both feasible and can be advantageous for quantum error correction.

Abstract

In quantum error correction, fast low-latency decoding is essential for fault-tolerant quantum computation, as delays in processing syndrome data can lead to the backlog problem. Existing decoders, including parallelizable approaches such as Union-Find, begin decoding only after all stabilizer measurement outcomes from an error-correction cycle have been received, inherently introducing a delay before decoding begins. We introduce Cluster-As-You-Go (CAYG), a modification of the Union-Find decoder that processes syndrome information during stabilizer measurements by clustering and correcting errors as they appear. This approach reduces the size of the remaining decoding problem at the end of the quantum error correction cycle and, consequently, the time required to complete the decoding process. While this early start of clustering incurs a modest reduction in decoding accuracy, it preserves the decoder's scalability. Surface-code simulations show that the resulting reduction in post-measurement idling can outweigh the accuracy loss, yielding an improved speed-accuracy trade-off. These results demonstrate that real-time, early-starting decoding during QEC cycles is both feasible and can be advantageous for quantum error correction. Demonstrated here for the surface code, CAYG is broadly applicable to other quantum error-correcting codes, which allow for clustering-based decoding approaches, and is extensible to dedicated real-time decoding hardware.

View source

Similar papers

Review Aug 2026

Practical Error Suppression and Mitigation for Reliable Quantum Computing

This review examines how error mitigation techniques can be adapted to encoded and logical-qubit settings so that they can operate alongside quantum error correction to suppress residual logical errors and improve the accuracy of computation in the early fault-tolerant regime.

Han-Ze Li, Mengjie Yang, Xian-Quan Yan et al. · 3 citations
Open access Sep 2026

Accelerating A*-Based Algorithms for Decoding Quantum Low-Density Parity-Check Codes

Numerical results demonstrate a substantial reduction in overall decoding complexity while maintaining the logical error rate (LER) of the stand-alone Tesseract.

Lamia Yous, Francisco García Herrero, Mark F. Flanagan · 0 citations
Preprint Aug 2026

High-Throughput Normalized Min-Sum Belief Propagation Decoding for Quantum LDPC Codes with Near-Memory Processing

Near-memory processing can provide high aggregate throughput and sub-millisecond compute latency for qLDPC BP decoding under the evaluated conditions, and shows that near-memory processing can provide high aggregate throughput and sub-millisecond compute latency for qLDPC BP decoding under the evaluated conditions.

Jeong-mae Seo, Youngsun Han, Leanghok Hour et al. · 0 citations
Preprint Oct 2026

Measure Now, Mitigate Later: Virtual Error Cancellation for Logical Quantum Circuits

Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and...

Oles Shtanko, Saswata Roy, Shashwat Kumar et al. · 0 citations
Preprint Sep 2026

Sparse-Blossom Decoding in $o(1)$ Time

A rigorous parallelization framework is presented and it is proved that the resulting parallel sparse-blossom algorithm produces the same correction as the original, non-parallel sparse blossom.

Ryohei Mikami, Hayata Yamasaki · 0 citations
Review Open access 2026

Quantum Error Correction Survey

The survey shows that scalable QEC depends on coordinated advances across codes, devices, control, decoding, architecture, and communication, together with common criteria including logical reliability, timing and throughput.

Muzammil-E-Haque Mahmud, Rajkumar Jain, Ze-Bo Yang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.