Color code decoder with improved scaling for correcting circuit-level noise

Abstract

Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing, as they have high encoding rates, transversal implementation of logical Clifford gates, and resource-efficient magic state preparation schemes. However, decoding color codes presents a significant challenge due to their structure, where elementary errors violate three checks instead of just two (a key feature in surface code decoding), and the complexity of extracting syndrome is greater. We introduce an efficient color-code decoder that tackles these issues by combining two matching decoders for each color, generalized to handle circuit-level noise by employing detector error models. We provide comprehensive analyses of the decoder, covering its threshold and sub-threshold scaling both for bit-flip noise with ideal measurements and for circuit-level noise. Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure ($p_{\mathrm{fail}}\sim p^{d/2}$) for both noise models, where $p$ is the noise strength, in the regime of interest for fault-tolerant quantum computing. While its noise thresholds are comparable with other matching-based decoders for color codes ($8.2\%$ for bit-flip noise and $0.46\%$ for circuit-level noise), the scaling of logical failure rates below threshold significantly outperforms the best matching-based decoders.

30 pages, 17 figures

References in corpus (28)

• Logical quantum processor based on reconfigurable atom arrays
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Demonstration of fault-tolerant universal quantum gate operations
• Magic State Distillation: Not as Costly as You Think
• Surface code implementation of block code state distillation
• Decoding color codes by projection onto surface 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
• Advantages of versatile neural-network decoding for topological codes
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Anyon condensation and the color code
• Demonstration of fault-tolerant Steane quantum error correction
• 2-D color code quantum computation
• Proof of finite surface code threshold for matching
• Efficient Decoding of Topological Color Codes
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Logical Error Rate Scaling of the Toric Code
• Analytic asymptotic performance of topological codes
• An Introduction to Topological Quantum Codes
• Tensor Network Decoding Beyond 2D
• Decoding quantum color codes with MaxSAT
• Ising model formulation for highly accurate topological color codes decoding
• Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
• Low-overhead quantum computing with the color code
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States

Cited by in corpus (7)

• Scaling and logic in the color code on a superconducting quantum processor
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Low-overhead magic state distillation with color codes
• Decoding across transversal Clifford gates in the surface code
• Distributed Realization of Color Codes for Quantum Error Correction
• Lattice Surgery Compilation Beyond the Surface Code
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code