An Analysis of Speculative Window Decoders for Quantum Error Correction

• URL: http://arxiv.org/abs/2606.24048v1
• Date: Tue, 23 Jun 2026 01:19:35 GMT
• Title: An Analysis of Speculative Window Decoders for Quantum Error Correction
• Abstract summary: Speculative window decoding improves performance by reducing the time spent waiting for dependencies from prior decoding windows.<n>Since different quantum technologies can have slower gate speeds, we evaluate the performance of speculative decoding under slow gate speeds.<n>This work presents design principles for identifying when speculative decoding yields the greatest performance improvements.
• Score: 1.4511819539624133
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computing is essential for realizing the substantial computational speedups that quantum computing can bring, but it requires real-time error decoding with high performance. Speculative window decoding improves performance by reducing the time spent waiting for dependencies from prior decoding windows. However, speculative decoders have only been evaluated under the regime of superconducting qubits with fast gate speeds, surface codes, and matching decoders. Since different quantum technologies can have slower gate speeds, we evaluate the performance of speculative decoding under slow gate speeds. We also examine its sensitivity to speculation accuracy, decoder latency, processor count, and workload parallelism, which can vary across different quantum error correction codes, decoders, and hardware platforms. This work presents design principles for identifying when speculative decoding yields the greatest performance improvements. It also reveals the conditions under which non-speculative decoders outperform speculative decoders.

Related papers

• 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)
• 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)
• Breadth-first graph traversal union-find decoder [0.0]
  We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
  arXiv  Detail & Related papers  (2024-07-22T18:54:45Z)
• Localized statistics decoding for quantum low-density parity-check codes [3.716393259548592]
  We introduce localized statistics decoding for arbitrary quantum low-density parity-check codes.<n>Our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.
  arXiv  Detail & Related papers  (2024-06-26T18:00:09Z)
• How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off [48.73569522869751]
  We show how to choose the best decoder for a given quantum architecture. By analyzing the speed vs. accuracy tradeoff, we propose strategies to select the optimal stopping time. We illustrate our protocol for the surface code equipped with a desktop implementation of the PyMatching decoder.
  arXiv  Detail & Related papers  (2023-10-23T19:30:08Z)
• 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)
• 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)
• 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)
• A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing [2.617437465051793]
  We design a decoder micro-architecture for the Union-Find decoding algorithm. We optimize the amount of decoding hardware required to perform error correction simultaneously over all the logical qubits of the quantum computer.
  arXiv  Detail & Related papers  (2020-01-18T04:44:52Z)

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.