A local pre-decoder to reduce the bandwidth and latency of quantum error correction
arXiv:2208.04660 · doi:10.1103/PhysRevApplied.19.034050
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 using qubits with physical error rate and a distance code, we find that the bandwidth cost is reduced by a factor of , and the time taken by a matching decoder is sped up by a factor of . To achieve this target failure probability, the pre-decoding approach requires a increase in the qubit count compared with the optimal decoder.
arXiv comment12 pages, 8 figures, comments welcome
References in corpus (37)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Reliable Quantum Computers
- Repeated Quantum Error Detection in a Surface Code
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- The XZZX Surface Code
- Fast Decoders for Topological Quantum Codes
- Almost-linear time decoding algorithm for topological codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Towards practical classical processing for the surface code
- A Neural Decoder for Topological Codes
- Topological and subsystem codes on low-degree graphs with flag qubits
- Reliable Cellular Automata with Self-Organization
- Decoding Small Surface Codes with Feedforward Neural Networks
- High threshold error correction for the surface code
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Decoding color codes by projection onto surface codes
- Triangular color codes on trivalent graphs with flag qubits
- Efficient Decoders for Qudit Topological Codes
- Cellular-automaton decoders with provable thresholds for topological codes
- Cellular-automaton decoders for topological quantum memories
- Scalable Neural Decoder for Topological Surface Codes
- Simulation of rare events in quantum error correction
- Linear-time general decoding algorithm for the surface code
- Improved HDRG decoders for qudit and non-Abelian quantum error correction
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- A decoder for the triangular color code by matching on a Möbius strip
- A simple decoder for topological codes
- The role of entropy in topological quantum error correction
- Error-rate-agnostic decoding of topological stabilizer codes
Cited by in corpus (19)
- Quantum error correction below the surface code threshold
- Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
- 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
- Synchronization for Fault-Tolerant Quantum Computers
- Optimization tools for distance-preserving flag fault-tolerant error correction
- C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
- Enhancing Quantum Memory Lifetime with Measurement-Free Local Error Correction and Reinforcement Learning
- Generalizing the matching decoder for the Chamon code
- Managing Classical Processing Requirements for Quantum Error Correction
- Pinball: A Cryogenic Predecoder for Surface Code Decoding Under Circuit-Level Noise
- Snowflake: A Distributed Streaming Decoder