Quantum computation with charge-and-color permuting twists in qudit color codes

Abstract

Twists are defects in the lattice which can be utilized to perform computations on encoded data. Twists have been studied in various classes of topological codes like qubit and qudit surface codes, qubit color codes and qubit subsystem color codes. They are known to exhibit projective non-Abelian statistics which is exploited to perform encoded gates. In this paper, we initiate the study of twists in qudit color codes over odd prime alphabet. To the best of our knowledge, this is the first study of twists in qudit color codes. Specifically, we present a systematic construction of twists in qudit color codes that permute both charge and color of the excitations. We also present a mapping between generalized Pauli operators and strings in the lattice. Making use of the construction, we give protocols to implement generalized Clifford gates using charge-and-color-permuting twists.

References in corpus (8)

• Surface codes: Towards practical large-scale quantum computation
• Topological Quantum Distillation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Projective non-Abelian Statistics of Dislocation Defects in a Z_N Rotor Model
• A scheme for universal high-dimensional quantum computation with linear optics
• Improved HDRG decoders for qudit and non-Abelian quantum error correction
• Generalized Color Codes Supporting Non-Abelian Anyons
• Color codes with twists: construction and universal gate set implementation

Cited by in corpus (2)

• Low-overhead quantum computing with the color code
• Color codes with domino twists: Construction, logical measurements, and computation