Color codes with twists: construction and universal gate set implementation

Abstract

Twists are defects in the lattice that can be used to perform encoded computations. Three basic types of twists can be introduced in color codes, namely, twists that permute color, charge of anyons and domino twists that permute the charge label of an anyon with a color label. In this paper, we study a subset these twists from coding theoretic viewpoint. Specifically, we discuss systematic construction of charge permuting and color permuting twists in color codes. We show that by braiding alone, Clifford gates can be realized in color codes with charge permuting twists. We also discuss implementing single qubit Clifford gates by Pauli frame update and CNOT gate by braiding holes around twists in color codes with color permuting twists. Finally, we also discuss implementing a non-Clifford gate by state injection, thus completing the realization of a universal gate set.

References in corpus (21)

• Fault-tolerant quantum computation by anyons
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum Error Correction for Quantum Memories
• Topological Quantum Distillation
• Surface code quantum computing by lattice surgery
• Models for gapped boundaries and domain walls
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Magic state distillation with low overhead
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Magic State Distillation: Not as Costly as You Think
• Projective non-Abelian Statistics of Dislocation Defects in a Z_N Rotor Model
• Multilevel distillation of magic states for quantum computing
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Quantum Measurements and Gates by Code Deformation
• Quantum Computing with Majorana Fermion Codes
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Clifford Gates by Code Deformation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• 2-D color code quantum computation

Cited by in corpus (2)

• Quantum computation with charge-and-color permuting twists in qudit color codes
• Color codes with domino twists: Construction, logical measurements, and computation