Error correction between logical operations has moved from requiring a number of syndrome extractions proportional to system size, denoted as O(d), to effectively zero. This advance, enabled by transversal CNOT gates, promises faster quantum computations but introduces a substantial challenge for classical decoders. PACE, a new scheduling framework, directly addresses this bottleneck by integrating decoder limitations into the planning process.
Researchers Limit Decoder Costs for Faster Fault-Tolerant Computation
Error correction between logical operations has moved from requiring a number of syndrome extractions proportional to system size, denoted as O(d), to effectively zero. This advance, enabled by transversal CNOT gates, promises faster quantum computations but introduces a substantial challenge for classical decoders. PACE, a new scheduling framework, directly addresses this bottleneck by integrating decoder limitations into the planning process.