A decoder for the triangular color code by matching on a Möbius strip
arXiv:2108.11395 · doi:10.1103/PRXQuantum.3.010310
Abstract
The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Here we propose a decoder for the planar color code with a triangular boundary where we match syndrome defects on a nontrivial manifold that has the topology of a Möbius strip. A basic implementation of our decoder used on the color code with hexagonal lattice geometry demonstrates a logical failure rate that is competitive with the optimal performance of the surface code, , with , error rate , and the code length. Furthermore, by exhaustively testing over five billion error configurations, we find that a modification of our decoder that manually compares inequivalent recovery operators can correct all errors of weight for codes with distance . Our decoder is derived using relations among the stabilizers that preserve global conservation laws at the lattice boundary. We present generalisations of our method to depolarising noise and fault-tolerant error correction, as well as to Majorana surface codes, higher-dimensional color codes and single-shot error correction.
arXiv comment31 pages, 27 figures, comments welcome; v2 - references added, typos corrected, revised discussion about exhaustive search, conclusions remain the same; v3 - final author version, changes made in response to peer review to improve clarity, conclusions unchanged
References in corpus (63)
- Fault-tolerant quantum computation by anyons
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- State preservation by repetitive error detection in a superconducting quantum circuit
- Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Roads towards fault-tolerant universal quantum computation
- Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- The XZZX Surface Code
- Quantum memories at finite temperature
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Topological Computation without Braiding
- Demonstration of weight-four parity measurements in the surface code architecture
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Single-shot fault-tolerant quantum error correction
- Unfolding the color code
- 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 thresholds for the surface code in excess of 5% under biased noise
- Majorana Fermion Surface Code for Universal Quantum Computation
- Foliated Quantum Codes
- Fault-tolerant error correction with the gauge color code
- Surface code implementation of block code state distillation
- Universal topological phase of 2D stabilizer codes
- Decoding color codes by projection onto surface codes
- Error Correction and Degeneracy in Surface Codes Suffering Loss
- 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
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Quantum Computing with Majorana Fermion Codes
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Parallelized quantum error correction with fracton topological codes
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- 2-D color code quantum computation
- The boundaries and twist defects of the color code and their applications to topological quantum computation
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Simulation of rare events in quantum error correction
- Efficient Decoding of Topological Color Codes
- Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
- Universal fault-tolerant measurement-based quantum computation
- Error- and Loss-Tolerances of Surface Codes with General Lattice Structures
- Improved HDRG decoders for qudit and non-Abelian quantum error correction
- Optimization of the surface code design for Majorana-based qubits
- Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
- Quantum Origami: Transversal Gates for Quantum Computation and Measurement of Topological Order
- Logical Error Rate Scaling of the Toric Code
- Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
- Error tolerance of topological codes with independent bit-flip and measurement errors
- The role of entropy in topological quantum error correction
- Fault-tolerant fermionic quantum computation based on color code
- Projecting 3D color codes onto 3D toric codes
- Scalable Fermionic Error Correction in Majorana Surface Codes
- Correcting spanning errors with a fractal code
- Quantum convolutional data-syndrome codes
- Stability of topologically-protected quantum computing proposals as seen through spin glasses