Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding

• URL: http://arxiv.org/abs/2605.03180v1
• Date: Mon, 04 May 2026 21:42:12 GMT
• Title: Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding
• Abstract summary: Lightweight predecoding holds promise to alleviate strain on shared decoding components.<n>We introduce an automated framework designed to generate predecoders for arbitrary qLDPC codes.<n>These automatically constructed predecoders autonomously process over 90% of the decoding workload, cutting overall decoder utilization by up to 3,963x.
• Score: 36.0083978873487
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum-classical interfaces (QCIs) for fault-tolerant quantum computing must manage simultaneous, real-time decoding across thousands to millions of logical qubits. Scaling these architectures necessitates sharing expensive decoding resources among logical qubits, which introduces severe resource contention within the QCI. While resolving these bottlenecks through efficient resource distribution remains a persistent challenge, lightweight predecoding holds promise to alleviate strain on shared decoding components by decreasing average latency and decoder usage. Notably, research into both decoder allocation and predecoding has been strictly confined to the surface code. With the growing emphasis on general quantum low-density parity-check (qLDPC) codes, slower decoding speeds will intensify resource contention, while the inherent complexity of these codes will render manual predecoder design unfeasible. To address this gap, we introduce an automated framework designed to generate predecoders for arbitrary qLDPC codes. These automatically constructed predecoders autonomously process over 90% of the decoding workload, cutting overall decoder utilization by up to 3,963x. This includes a reduction of up to 72.71% in computationally demanding ordered statistics decoding (OSD). Furthermore, we detail a highly efficient, pipelined hardware design that allows for the concurrent decoding of approximately 1,200 bivariate bicycle (BB) code logical qubits using a single FPGA. When implemented as a cryogenic ASIC, the architecture scales to support between 36,000 and 360,000 BB code logical qubits, operating within a 1.5 W power limit at 4 K.

Related papers

• Zero-G: A Pre-Decoder-Aware Decoder for Quantum Error Correction [37.85207107619702]
  We present Zero-G, a strong decoder designed for use alongside pre-decoders.<n>By hardware decoupling control from the decoding core itself, we enable heterogeneous deployment across both FPGAs and CPU.<n>We scale to 640 logical qubits on a single 128-core CPU and 32 logical qubits on a single AMD Versal V80 FPGA.
  arXiv  Detail & Related papers  (2026-08-03T10:25:29Z)
• Bidirectional Decoding for Concatenated Quantum Hamming Codes [6.26319455798863]
  We introduce a hard-decision decoder ford quantum codes with time complexity for scaling.<n>For thed $[15,3]]$ quantum Hamming code under independent bit-flip noise, the bidirectional decoder improves the threshold.<n>Our results can enhance the competitiveness of low-overhead fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2026-01-14T04:09:37Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Local Clustering Decoder: a fast and adaptive hardware decoder for the surface code [0.0]
  We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. It enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding.
  arXiv  Detail & Related papers  (2024-11-15T16:43:59Z)
• Generalizing the matching decoder for the Chamon code [1.8416014644193066]
  We implement variations of a matching decoder for a three-dimensional, non-CSS, low-density parity check code known as the Chamon code.<n>We find that a generalized matching decoder that is augmented by a belief-propagation step prior to matching gives a threshold of 10.5% for depolarizing noise.
  arXiv  Detail & Related papers  (2024-11-05T19:00:12Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Managing Classical Processing Requirements for Quantum Error Correction [6.995407614018462]
  We show that efficient decoder scheduling is essential to making quantum error correction practical.<n>Our approach reduces decoder requirements by 10-40% across fault-tolerant benchmarks.
  arXiv  Detail & Related papers  (2024-06-26T00:50:10Z)
• Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
  We introduce the Ambiguity Clustering decoder (AC) which divides measurement data into clusters that can be decoded independently.<n>With 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy.<n>Our implementation decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU.
  arXiv  Detail & Related papers  (2024-06-20T17:39:31Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Better Than Worst-Case Decoding for Quantum Error Correction [6.943255454097062]
  We propose a lightweight decoder for decoding and correcting trivial common-case errors on superconducting quantum systems. The decoder is implemented for SFQ logic. It achieves 10-10000x bandwidth reduction over prior off-chip bandwidth reduction techniques. It achieves a 15-37x resource overhead reduction compared to prior on-chip-only decoding.
  arXiv  Detail & Related papers  (2022-08-17T21:26:48Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.