The surface code with a twist

Abstract

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new variety called twists have made it possible to implement the full Clifford group without state distillation. Here we investigate a patch-based encoding involving a modified twist. In our modified formulation, the resulting codes, called triangle codes for the shape of their planar layout, have only weight-four checks and relatively simple syndrome extraction circuits that maintain a high, near surface-code-level threshold. They also use 25% fewer physical qubits per logical qubit than the surface code. Moreover, benefiting from the twist, we can implement all Clifford gates by lattice surgery without the need for state distillation. By a surgical transformation to the surface code, we also develop a scheme of doing all Clifford gates on surface code patches in an atypical planar layout, though with less qubit efficiency than the triangle code. Finally, we remark that logical qubits encoded in triangle codes are naturally amenable to logical tomography, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.

10 pages + 6.5 page appendix, 23 figures

References in corpus (12)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Low-distance Surface Codes under Realistic Quantum Noise
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Subsystem fault tolerance with the Bacon-Shor code
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Effective fault-tolerant quantum computation with slow measurements
• Universal transversal gates with color codes - a simplified approach
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes

Cited by in corpus (51)

• Quantum Chemistry in the Age of Quantum Computing
• The XZZX Surface Code
• Quantum error correction with only two extra qubits
• Topological and subsystem codes on low-degree graphs with flag qubits
• Flag fault-tolerant error correction with arbitrary distance codes
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Deep neural decoders for near term fault-tolerant experiments
• Fault-tolerant magic state preparation with flag qubits
• Advantages of versatile neural-network decoding for topological codes
• Simulating the performance of a distance-3 surface code in a linear ion trap
• Quantum Computing with Majorana Fermion Codes
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Surface code compilation via edge-disjoint paths
• Anyon condensation and the color code
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Logical blocks for fault-tolerant topological quantum computation
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
• Boundaries of quantum supremacy via random circuit sampling
• 2-D Compass Codes
• Universal fault-tolerant measurement-based quantum computation
• Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
• Fault Tolerance with Bare Ancillae for a [[7,1,3]] Code
• Fault-tolerant gates on hypergraph product codes
• Tailored XZZX codes for biased noise
• Fault-tolerant Quantum Error Correction on Near-term Quantum Processors using Flag and Bridge Qubits
• Fault-tolerant qubit from a constant number of components
• Handling Leakage with Subsystem Codes
• Clifford-deformed Surface Codes
• Direct measurement of Bacon-Shor code stabilizers
• Controlling error orientation to improve quantum algorithm success rates
• Performance of surface codes in realistic quantum hardware
• Topological wormholes
• Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
• A four-dimensional toric code with non-Clifford transversal gates
• Extended flag gadgets for low-overhead circuit verification
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Achieving fault tolerance on capped color codes with few ancillas
• Lattice Surgery on the Raussendorf Lattice
• Fault-tolerant quantum error correction using error weight parities
• 3-Fermion topological quantum computation
• Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
• Parallel syndrome extraction with shared flag qubits for Calderbank-Shor-Steane codes of distance three
• Comparison of 2D topological codes and their decoding performances
• Fault-tolerant syndrome extraction and cat state preparation with fewer qubits
• A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
• A graph-based formalism for surface codes and twists
• Improving Performance of an Analog Electronic Device Using Quantum Error Correction
• Quantum computation with charge-and-color permuting twists in qudit color codes
• Between Shor and Steane: A unifying construction for measuring error syndromes