Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling

• URL: http://arxiv.org/abs/2512.02539v1
• Date: Tue, 02 Dec 2025 09:07:00 GMT
• Title: Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling
• Authors: Dongmin Kim, Jeonggeun Seo, Youngtae Kim, Youngsun Han,
• Abstract summary: 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.
• Score: 3.7768601360100647
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fault-tolerant quantum computing (FTQC) requires fast and accurate decoding of Quantum Error Correction (QEC) syndromes. However, in large-scale systems, the number of available decoders is much smaller than the number of logical qubits, leading to a fundamental resource shortage. To address this limitation, Virtualized Quantum Decoder (VQD) architectures have been proposed to share a limited pool of decoders across multiple qubits. While the Minimize Longest Undecoded Sequence (MLS) heuristic has been introduced as an effective scheduling policy within the VQD framework, its locally greedy decision-making structure limits its ability to consider global circuit structure, causing inefficiencies in resource balancing and limited scalability. In this work, we propose Constraint-Optimal Driven Allocation (CODA), an optimization-based scheduling algorithm that leverages global circuit structure to minimize the longest undecoded sequence length. Across 19 benchmark circuits, CODA achieves an average 74\% reduction in the longest undecoded sequence length. Crucially, while the theoretical search space scales exponentially with circuit size, CODA effectively bypasses this combinatorial explosion. Our evaluation confirms that the scheduling time scales linearly with the number of qubits, determined by physical resource constraints rather than the combinatorial search space, ensuring robust scalability for large-scale FTQC systems. These results demonstrate that CODA provides a global optimization-based, scalable scheduling solution that enables efficient decoder virtualization in large-scale FTQC systems.

Related papers

• FPGA-tailored algorithms for real-time decoding of quantum LDPC codes [1.213715600410032]
  We analyze FPGA-tailored versions of three decoder classes for quantum low-density parity-check (qLDPC) codes.<n>For message passing, we analyze the recently introduced Relay decoder and its FPGA implementation.<n>For ordered statistics decoding, we introduce a filtered variant that concentrates on high-likelihood fault locations.<n>We design an FPGA-adapted generalized union-find decoder.
  arXiv  Detail & Related papers  (2025-11-26T18:33:47Z)
• 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)
• A Quantum Approximate Optimization Algorithm-based Decoder Architecture for NextG Wireless Channel Codes [6.52154420965995]
  Forward Error Correction (FEC) provides reliable data flow in wireless networks despite the presence of noise and interference. FEC processing demands significant fraction of a wireless network's resources, due to its computationally-expensive decoding process. We present FDeQ, a QAOA-based FEC Decoder design targeting the popular NextG wireless Low Density Parity Check (LDPC) and Polar codes. FDeQ achieves successful decoding with error performance at par with state-of-the-art classical decoders at low FEC code block lengths.
  arXiv  Detail & Related papers  (2024-08-21T15:53:09Z)
• A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes [12.687083899824314]
  Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms. We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC) Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
  arXiv  Detail & Related papers  (2023-05-25T06:23:32Z)
• 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)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• 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.