Managing Classical Processing Requirements for Quantum Error Correction
arXiv:2406.17995 · doi:10.1145/3767295.3803584
Abstract
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.
References in corpus (31)
- Surface codes: Towards practical large-scale quantum computation
- Simulated Quantum Computation of Molecular Energies
- Quantum Error Correction for Quantum Memories
- Surface code quantum computing by lattice surgery
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Resource-Aware Quantum Programming with General Recursion and Quantum Control
- Low-distance Surface Codes under Realistic Quantum Noise
- Magic State Distillation: Not as Costly as You Think
- Decoding Small Surface Codes with Feedforward Neural Networks
- Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
- Parallel window decoding enables scalable fault tolerant quantum computation
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Assessing requirements to scale to practical quantum advantage
- Surface code compilation via edge-disjoint paths
- Low overhead quantum computation using lattice surgery
- A scalable and fast artificial neural network syndrome decoder for surface codes
- A local pre-decoder to reduce the bandwidth and latency of quantum error correction
- A High Performance Compiler for Very Large Scale Surface Code Computations
- Inplace Access to the Surface Code Y Basis
- Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
- Optimal ancilla-free Clifford+T approximation of z-rotations
- Hierarchical decoding to reduce hardware requirements for quantum computing
- NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for Surface Codes
- Micro Blossom: Accelerated Minimum-Weight Perfect Matching Decoding for Quantum Error Correction
- Modular decoding: parallelizable real-time decoding for quantum computers
- Magic state cultivation: growing T states as cheap as CNOT gates
- Spatially parallel decoding for multi-qubit lattice surgery
- How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off
- Belief propagation as a partial decoder
- Promatch: Extending the Reach of Real-Time Quantum Error Correction with Adaptive Predecoding