Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes

Abstract

One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the ${\mathbb{Z}}_2$ surface code. Logical qubits can be encoded in a variety of ways in the surface code, based on either boundary defects, holes, or bulk twist defects. However proposed fault-tolerant implementations of the Clifford group in these schemes are limited and often require unnecessary overhead. For example, the Clifford phase gate in certain planar and hole encodings has been proposed to be implemented using costly state injection and distillation protocols. In this paper, we show that within any encoding scheme for the logical qubits, we can fault-tolerantly implement the full Clifford group by using joint measurements involving a single appropriately encoded logical ancilla. This allows us to provide new low overhead implementations of the full Clifford group in surface and color codes. It also provides the first proposed implementations of the full Clifford group in hyperbolic codes. We further use our methods to propose state-of-the art encoding schemes for small numbers of logical qubits; for example, for code distances $d=3,5,7$, we propose a scheme using $60,160,308$ (respectively) physical data qubits, which allow for the full logical Clifford group to be implemented on two logical qubits. To our knowledge, this is the optimal proposal to date, and thus may be useful for demonstration of fault-tolerant logical gates in small near-term quantum computers.

arXiv comment23 pages, 38 figures, 2 appendices

References in corpus (50)

• Fault-tolerant quantum computation by anyons
• Non-Abelian Anyons and Topological Quantum Computation
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• High threshold universal quantum computation on the surface code
• Models for gapped boundaries and domain walls
• A fault-tolerant one-way quantum computer
• Exotic non-Abelian anyons from conventional fractional quantum Hall states
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Topological phases with parafermions: theory and blueprints
• Genons, twist defects, and projective non-Abelian braiding statistics
• Topological Nematic States and Non-Abelian Lattice Dislocations
• Fractionalizing Majorana fermions: non-abelian statistics on the edges of abelian quantum Hall states
• Fast Decoders for Topological Quantum Codes
• Protected edge modes without symmetry
• Superconducting Proximity Effect on the Edge of Fractional Topological Insulators
• Towards practical classical processing for the surface code
• Tradeoffs for reliable quantum information storage in 2D systems
• Theory of defects in Abelian topological states
• Unfolding the color code
• Classification of Topological Defects in Abelian Topological States
• Fault-tolerant thresholds for quantum error correction with the surface code
• Projective non-Abelian Statistics of Dislocation Defects in a Z_N Rotor Model
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Quantum Measurements and Gates by Code Deformation
• The surface code with a twist
• Measurement-Only Topological Quantum Computation via Anyonic Interferometry
• Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Clifford Gates by Code Deformation
• Synthetic Topological Degeneracy by Anyon Condensation
• $U(1)\times U(1)⋊Z_2$ Chern-Simons Theory and Z_4 Parafermion Fractional Quantum Hall States
• 2-D color code quantum computation
• Proof of finite surface code threshold for matching
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Unconventional Fusion and Braiding of Topological Defects in a Lattice Model
• Topological code Autotune
• Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes
• Logical Error Rate Scaling of the Toric Code
• Topological Quantum Computation with Gapped Boundaries
• Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS
• Analytic asymptotic performance of topological codes
• Modular transformations through sequences of topological charge projections

Cited by in corpus (17)

• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Logical blocks for fault-tolerant topological quantum computation
• Fault-tolerant gates on hypergraph product codes
• Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
• A decoder for the triangular color code by matching on a Möbius strip
• Fold-Transversal Clifford Gates for Quantum Codes
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Instantaneous braids and Dehn twists in topologically ordered states
• 3-Fermion topological quantum computation
• Low-overhead quantum computing with the color code
• Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
• The domain wall color code
• Soft symmetries of topological orders
• Quantum computation with charge-and-color permuting twists in qudit color codes
• Color codes with domino twists: Construction, logical measurements, and computation
• Surface code dislocations have code distance L+O(1)