Low-overhead quantum computing with the color code

Abstract

Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in parallel while keeping the space cost low. Compared to lattice surgery schemes based on the surface code with the same code distance, our approach yields about a $3\times$ improvement in the space-time overhead, obtained from a combination of a $1.5\times$ improvement in spatial overhead together with a $2\times$ speedup due to the parallelisation of commuting logical measurements. Even when taking into account the color code's lower error threshold using current decoders, the overhead is reduced by 10\% at a physical error rate of $10^{-3}$ and by 50\% at $10^{-4}$.

12 pages, 8 figures, comments welcome; v2 - extended discussion in response to referee reports

References in corpus (58)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Error Correction for Quantum Memories
• Suppressing quantum errors by scaling a surface code logical qubit
• Reliable Quantum Computers
• Fault-tolerant quantum computation with high threshold in two dimensions
• Stabilizer Codes and Quantum Error Correction
• Topological Quantum Distillation
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• Symmetry Fractionalization, Defects, and Gauging of Topological Phases
• Models for gapped boundaries and domain walls
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• TFT construction of RCFT correlators I: Partition functions
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Building a fault-tolerant quantum computer using concatenated cat codes
• The XZZX Surface Code
• Protected edge modes without symmetry
• Magic State Distillation: Not as Costly as You Think
• Fault-tolerant quantum computation against biased noise
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Unfolding the color code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Classification of Topological Defects in Abelian Topological States
• Fault-tolerant thresholds for quantum error correction with the surface code
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Quantum Measurements and Gates by Code Deformation
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Universal topological phase of 2D stabilizer codes
• Triangular color codes on trivalent graphs with flag qubits
• Topological color code and symmetry-protected topological phases
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• The ZX calculus is a language for surface code lattice surgery
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Clifford Gates by Code Deformation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Anyon condensation and the color code
• 2-D color code quantum computation
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Unconventional Fusion and Braiding of Topological Defects in a Lattice Model
• 2-D Compass Codes
• Unifying flavors of fault tolerance with the ZX calculus
• A decoder for the triangular color code by matching on a Möbius strip
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS
• Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
• Computing data for Levin-Wen with defects
• Computing Defects Associated to Bounded Domain Wall Structures: The $\mathrm{Vec}(\mathbb{Z}/p\mathbb{Z})$ Case
• Quantum computation with charge-and-color permuting twists in qudit color codes

Cited by in corpus (7)

• Scaling and logic in the color code on a superconducting quantum processor
• Color code decoder with improved scaling for correcting circuit-level noise
• 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
• Distributed Realization of Color Codes for Quantum Error Correction
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code