Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2605.04459v1
• Date: Wed, 06 May 2026 03:39:24 GMT
• Title: Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation
• Abstract summary: Fault-tolerant quantum computation (FTQC) depends on real-time classical decoding.<n>FTQC computation is rapidly emerging as a system bottleneck.<n>We propose Triage, a dual-mode architecture that mitigates operation stalls by adaptively combining a cost-efficient scheduler with a priority-aware emergency mode.
• Score: 7.84307291746753
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computation (FTQC) critically depends on real-time classical decoding, which is rapidly emerging as a system bottleneck. As quantum systems scale, decoding latency and throughput limitations lead to exponential syndrome backlogs and logical operation stalls. While hardware accelerators and parallel windowing offer pathways to speed up decoding, dynamically deploying a finite pool of decoders across a vast quantum error correction architecture remains an unresolved resource allocation problem. To address this, we formulate FTQC decoding as a constrained dynamic scheduling problem by utilizing a spatio-temporal framework based on slices. We propose Triage, a dual-mode architecture that mitigates operation stalls by adaptively combining a cost-efficient heuristic scheduler with a priority-aware emergency mode to rapidly resolve the causal cone of critical operations. Our evaluation shows that Triage maintains low algorithm stalls and logical error rates even under scarce classical resource constraints. Across various benchmarks, Triage achieves an average logical error rate reduction of 52.6% compared to standard temporal parallelism, enabling an efficient classical control plane for scalable FTQC architectures.

Related papers

• Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation [1.6724455800127804]
  Current scheduling models treat logical operations as atomic, hiding the fact that these subsystems operate sequentially and spend significant time idle.<n>We present a pipelined execution framework that decomposes each logical operation into its component stages.<n>We show that pipelining with speculation reduces total pipeline steps by 20-40% compared to a no-speculation baseline.
  arXiv  Detail & Related papers  (2026-06-17T20:47:45Z)
• Real-Time Quantum Error Correction System Stack: Architecture, Algorithms, and Engineering Practice [5.934193075751239]
  Quantum error correction (QEC) is transitioning from physical feasibility demonstrations to systems engineering challenges.<n>Google has achieved below-latency performance on distance-5/7 surface codes.<n>Riverlane and Rigetti have demonstrated hardware-integrated low-threshold feedback loops.
  arXiv  Detail & Related papers  (2026-05-29T02:51:46Z)
• Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling [3.7768601360100647]
  Fault-tolerant quantum computing requires fast and accurate decoding of Quantum Error Correction syndromes.<n>In large-scale systems, the number of available decoders is much smaller than the number of logical qubits, leading to a fundamental resource shortage.<n>To address this limitation, Virtualized Quantum Decoder (VQD) architectures have been proposed to share a limited pool of decoders across multiple qubits.
  arXiv  Detail & Related papers  (2025-12-02T09:07:00Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• 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)
• Bubble Clustering Decoder for Quantum Topological Codes [8.62986288837424]
  We introduce the bubble clustering decoder for quantum surface codes, which serves as a low-latency replacement for MWPM.<n>This speed boost is obtained leveraging an efficient cluster generation based on bubbles centered on defects.<n>For moderate physical error rates, this is equivalent to linear complexity in the number of data qubits.
  arXiv  Detail & Related papers  (2025-04-02T12:02:34Z)
• Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding [11.657137510701165]
  A crucial challenge of fault-tolerant quantum computing is reducing the overhead of implementing logical gates.<n>We propose an architecture that employs delayed fixup circuits and window-based correlated decoding.<n>This design significantly reduces both the frequency and duration of decoding, while maintaining support for constant-time and universal logical gates.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• 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)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.