Zero-G: A Pre-Decoder-Aware Decoder for Quantum Error Correction

• URL: http://arxiv.org/abs/2608.02030v1
• Date: Mon, 03 Aug 2026 10:25:29 GMT
• Title: Zero-G: A Pre-Decoder-Aware Decoder for Quantum Error Correction
• Abstract summary: 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.
• Score: 37.85207107619702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computing requires classical decoders that keep pace with the underlying hardware, translating syndrome measurements into corrections fast enough to avoid an exponential backlog. To meet this real-time constraint, pre-decoders have emerged as part of a hierarchical decoding approach to resolve simple, local errors before passing a sparser residual syndrome to a strong decoder. While pre-decoding should, in theory, speed up the strong decoder, in practice, the speedup is only marginal, since existing strong decoders are designed to decode dense syndromes and cannot exploit the sparsity provided by pre-decoders. To address this, we present Zero-G, a strong decoder designed for use alongside pre-decoders. As a stochastic approximate minimum-weight perfect matching (MWPM) decoder, Zero-G exploits sparse residual syndromes, dynamically trading latency for accuracy rather than relying on an all-or-nothing runtime-accuracy trade-off. By decoupling hardware control from the decoding core itself, we enable heterogeneous deployment across both FPGAs and CPUs without maintaining separate implementations. Zero-G achieves a $10\times$ latency improvement over existing strong decoders at matching accuracy, with worst-case sub-350ns decoding at code distances up to d=15, while scaling to 640 logical qubits on a single 128-core CPU and 32 logical qubits on a single AMD Versal V80 FPGA.

Related papers

• Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding [36.0083978873487]
  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.
  arXiv  Detail & Related papers  (2026-05-04T21:42:12Z)
• Decoder Switching: Breaking the Speed-Accuracy Tradeoff in Real-Time Quantum Error Correction [2.370310454459195]
  Efforts to improve the decoder's accuracy often lead to unacceptable increases in decoding time and hardware complexity.<n>We propose a novel framework, decoder switching, which balances these competing demands by combining a faster, soft-output decoder with a slower, high-accuracy decoder.<n>We show that this framework can achieve accuracy comparable to, or even surpassing, that of the strong decoder, while maintaining an average decoding time on par with the weak decoder.
  arXiv  Detail & Related papers  (2025-10-29T06:56:33Z)
• 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)
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction [3.222802562733787]
  A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware. We propose a local pre-decoder', which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We find substantial improvements in the runtime of the global decoder and the communication bandwidth by using the pre-decoder.
  arXiv  Detail & Related papers  (2022-08-09T11:01:56Z)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Adversarial Neural Networks for Error Correcting Codes [76.70040964453638]
  We introduce a general framework to boost the performance and applicability of machine learning (ML) models. We propose to combine ML decoders with a competing discriminator network that tries to distinguish between codewords and noisy words. Our framework is game-theoretic, motivated by generative adversarial networks (GANs)
  arXiv  Detail & Related papers  (2021-12-21T19:14:44Z)

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.