Managing Classical Processing Requirements for Quantum Error Correction
For quantum computing system architects, this work addresses the practical challenge of provisioning classical hardware for error correction, showing that efficient scheduling can significantly reduce resource requirements.
The paper identifies decoder demand fluctuation as a systems-level capacity planning problem for quantum error correction and proposes a two-level scheduling framework that treats decoders as shared accelerators, reducing decoder requirements by 10-40% across fault-tolerant benchmarks.
Large-scale quantum computers promise transformative speedups, but their viability hinges on fast and reliable quantum error correction (QEC). At the center of QEC are decoders-classical algorithms running on hardware such as FPGAs, GPUs, or CPUs that process error syndromes to detect errors every microsecond to preserve fault-tolerance. Quantum processors, therefore, operate not in isolation, but as accelerators tightly coupled with powerful classical digital hardware. A key challenge is that decoder demand fluctuates unpredictably: bursts of activity can require orders of magnitude more decodes than idle periods. Provisioning hardware for the worst case wastes resources, while provisioning for the average case risks catastrophic slowdowns. We show that this mismatch is a systems problem of capacity planning and scheduling, and propose a two-level framework that treats decoders as shared accelerators managed by the quantum operating system. Our approach reduces decoder requirements by 10-40% across fault-tolerant benchmarks, demonstrating that efficient decoder scheduling is essential to making FTQC practical.