Minimising surface-code failures using a color-code decoder

Abstract

The development of practical, high-performance decoding algorithms reduces the resource cost of fault-tolerant quantum computing. Here we propose a decoder for the surface code that finds low-weight correction operators for errors produced by the depolarising noise model. The decoder is obtained by mapping the syndrome of the surface code onto that of the color code, thereby allowing us to adopt more sophisticated color-code decoding algorithms. Analytical arguments and exhaustive testing show that the resulting decoder can find a least-weight correction for all weight $d/2$ depolarising errors for even code distance $d$. This improves the logical error rate by an exponential factor $O(2^{d/2})$ compared with decoders that treat bit-flip and dephasing errors separately. We demonstrate this improvement with analytical arguments and supporting numerical simulations at low error rates. Of independent interest, we also demonstrate an exponential improvement in logical error rate for our decoder used to correct independent and identically distributed bit-flip errors affecting the color code compared with more conventional color-code decoding algorithms.

References in corpus (53)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Roads towards fault-tolerant universal quantum computation
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• The XZZX Surface Code
• Fast Decoders for Topological Quantum Codes
• Quantum memories at finite temperature
• Topological Computation without Braiding
• Long-range quantum entanglement in noisy cluster states
• A Neural Decoder for Topological Codes
• Unfolding the color code
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Encoding a magic state with beyond break-even fidelity
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• High threshold error correction for the surface code
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Coping with qubit leakage in topological codes
• Universal topological phase of 2D stabilizer codes
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Triangular color codes on trivalent graphs with flag qubits
• Efficient Decoders for Qudit Topological Codes
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• An efficient Markov chain Monte Carlo algorithm for the surface code
• Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes
• Anyon condensation and the color code
• Parallelized quantum error correction with fracton topological codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Boundaries for the Honeycomb Code
• Simulation of rare events in quantum error correction
• Performance of planar Floquet codes with Majorana-based qubits
• Quantifying the effects of local many-qubit errors and non-local two-qubit errors on the surface code
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Multi-path Summation for Decoding 2D Topological Codes
• Benchmarking the Planar Honeycomb Code
• Bias-tailored quantum LDPC codes
• Toric codes and quantum doubles from two-body Hamiltonians
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Breakdown of Surface Code Error Correction Due to Coupling to a Bosonic Bath
• The XYZ${}^2$ hexagonal stabilizer code
• Conservation laws and quantum error correction: towards a generalised matching decoder
• Adaptive surface code for quantum error correction in the presence of temporary or permanent defects
• Tailoring three-dimensional topological codes for biased noise
• The role of entropy in topological quantum error correction
• A cellular automaton decoder for a noise-bias tailored color code
• Correcting spanning errors with a fractal code
• Actis: A Strictly Local Union-Find Decoder
• Graphical algorithms and threshold error rates for the 2d colour code
• Union-find quantum decoding without union-find

Cited by in corpus (2)

• Data-driven decoding of quantum error correcting codes using graph neural networks
• Generalizing the matching decoder for the Chamon code