Decoder Switching: Breaking the Speed-Accuracy Tradeoff in Real-Time Quantum Error Correction

• URL: http://arxiv.org/abs/2510.25222v1
• Date: Wed, 29 Oct 2025 06:56:33 GMT
• Title: Decoder Switching: Breaking the Speed-Accuracy Tradeoff in Real-Time Quantum Error Correction
• Authors: Riki Toshio, Kaito Kishi, Jun Fujisaki, Hirotaka Oshima, Shintaro Sato, Keisuke Fujii,
• Abstract summary: 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.
• Score: 2.370310454459195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The realization of fault-tolerant quantum computers hinges on the construction of high-speed, high-accuracy, real-time decoding systems. The persistent challenge lies in the fundamental trade-off between speed and accuracy: efforts to improve the decoder's accuracy often lead to unacceptable increases in decoding time and hardware complexity, while attempts to accelerate decoding result in a significant degradation in logical error rate. To overcome this challenge, we propose a novel framework, decoder switching, which balances these competing demands by combining a faster, soft-output decoder ("weak decoder") with a slower, high-accuracy decoder ("strong decoder"). In usual rounds, the weak decoder processes error syndromes and simultaneously evaluates its reliability via soft information. Only when encountering a decoding window with low reliability do we switch to the strong decoder to achieve more accurate decoding. Numerical simulations suggest 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. We also develop an online decoding scheme tailored to our framework, named double window decoding, and elucidate the criteria for preventing an exponential slowdown of quantum computation. These findings break the long-standing speed-accuracy trade-off, paving the way for scalable real-time decoding devices.

Related papers

• A scalable and real-time neural decoder for topological quantum codes [8.06084037728433]
  Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits.<n>Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable.<n>Here we introduce AlphaQubit 2, a neural-network decoder that achieves near-optimal logical error rates for both surface and colour codes.
  arXiv  Detail & Related papers  (2025-12-08T17:24:59Z)
• Scalable Neural Decoders for Practical Real-Time Quantum Error Correction [1.474723404975345]
  We introduce and evaluate a textitMamba-based decoder, a state-space model with $mathcalO(d2)$ complexity.<n>Mamba decoders offer a compelling balance between speed and accuracy, making them a promising architecture for scalable, real-time quantum error correction.
  arXiv  Detail & Related papers  (2025-10-26T15:49:46Z)
• 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)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Belief propagation as a partial decoder [0.0]
  We present a new two-stage decoder that accelerates the decoding cycle and boosts accuracy. In the first stage, a partial decoder based on belief propagation is used to correct errors that occurred with high probability. In the second stage, a conventional decoder corrects any remaining errors.
  arXiv  Detail & Related papers  (2023-06-29T17:44:20Z)
• 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)
• 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)
• 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.