Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders

Abstract

We introduce an efficient decoder of the color code in $d\ge 2$ dimensions, the Restriction Decoder, which uses any $d$-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We also numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise with perfect syndrome extraction. We report that the 2D color code threshold $p_{\text{2D}}\approx 10.2\%$ on the square-octagon lattice is on a par with the toric code threshold on the square lattice.

32 pages, 12 figures, journal version (same as v2, different license)

References in corpus (16)

• Surface codes: Towards practical large-scale quantum computation
• Topological Quantum Distillation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Quantum memories based on engineered dissipation
• Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
• Universal transversal gates with color codes - a simplified approach
• Error Threshold for Color Codes and Random 3-Body Ising Models
• Tailoring surface codes for highly biased noise
• Fault-tolerant logical gates in quantum error-correcting codes
• Triangular color codes on trivalent graphs with flag qubits
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes
• Cellular-automaton decoders with provable thresholds for topological codes
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Morphing quantum codes

Cited by in corpus (21)

• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Decoding algorithms for surface codes
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Quantum computation from dynamic automorphism codes
• Color code decoder with improved scaling for correcting circuit-level noise
• Ising model formulation for highly accurate topological color codes decoding
• Low-overhead quantum computing with the color code
• Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
• Robust sparse IQP sampling in constant depth
• Low-overhead magic state distillation with color codes
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Protecting information via probabilistic cellular automata
• Minimising surface-code failures using a color-code decoder
• Generalizing the matching decoder for the Chamon code
• Layer-by-layer disentangling two-dimensional topological quantum codes
• Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits
• Lattice Surgery Compilation Beyond the Surface Code
• Layer codes as partially self-correcting quantum memories
• On the interpretability of neural network decoders
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code