A local pre-decoder to reduce the bandwidth and latency of quantum error correction

Abstract

A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware to perform quantum error correction. It is important that the decoder can keep pace with the quantum clock speed, within the limitations on communication that are imposed by the physical architecture. To this end we propose a local `pre-decoder', which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We study these classical overheads for the surface code under a phenomenological phase-flip noise model with imperfect measurements. We find substantial improvements in the runtime of the global decoder and the communication bandwidth by using the pre-decoder. For instance, to achieve a logical failure probability of $f=10^{-15}$ using qubits with physical error rate $p=10^{-3}$ and a distance $d=22$ code, we find that the bandwidth cost is reduced by a factor of $1000$, and the time taken by a matching decoder is sped up by a factor of $200$. To achieve this target failure probability, the pre-decoding approach requires a $50\%$ increase in the qubit count compared with the optimal decoder.

12 pages, 8 figures, comments welcome

References in corpus (5)

• Surface codes: Towards practical large-scale quantum computation
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Improved HDRG decoders for qudit and non-Abelian quantum error correction
• The role of entropy in topological quantum error correction
• Error-rate-agnostic decoding of topological stabilizer codes

Cited by in corpus (18)

• Quantum error correction below the surface code threshold
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Techniques for combining fast local decoders with global decoders under circuit-level noise
• A "thoughtful" Local Friendliness no-go theorem: a prospective experiment with new assumptions to suit
• Performance enhancement of surface codes via recursive MWPM decoding
• ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
• Actis: A Strictly Local Union-Find Decoder
• Mitigating errors in logical qubits
• Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
• Spatially parallel decoding for multi-qubit lattice surgery
• C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
• Optimization tools for distance-preserving flag fault-tolerant error correction
• Synchronization for Fault-Tolerant Quantum Computers
• Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
• Generalizing the matching decoder for the Chamon code
• Snowflake: A Distributed Streaming Decoder
• Pinball: A Cryogenic Predecoder for Surface Code Decoding Under Circuit-Level Noise
• Managing Classical Processing Requirements for Quantum Error Correction