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 the odd prime alphabet. 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.
There exists a close relationship between topological quantum error-correcting codes and topological order in condensed matter systems. Indeed, a topological stabilizer code can be regarded as the ground state of a suitable Hamiltonian model, so that "wrong" syndromes correspond to excitations. These excitations are anyons, quasiparticles that carry a topological charge and exhibit exotic statistics. Anyon models can be symmetric under some permutations of their topological charges. One can then conceive topological defects that, under monodromy, transform anyons according to a symmetry. We call these defects twists. Twists give rise to new topological degrees of freedom in the ground state, useful as a quantum memory. Moreover, twists can be braided to perform topologically protected gates on these topological qubits. Thus, twists provide a new way to encode and compute with topological codes through code deformations. Because the properties of twists depend on the anyon model, codes with different anyon content give rise to different computational capabilities. E.g., in the well-known toric code a process where suitable twists are braided and fused has the same outcome as if they were Ising anyons. These are non-abelian anyons: braiding produces non-trivial gates on encoded qubits.
We describe in detail how to perform universal fault-tolerant quantum computation on a two-dimensional color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple-defect logical qubits are deformed into isolated triangular sections of color code to enable transversal implementation of all single logical qubit Clifford group gates. Controlled-NOT (CNOT) is implemented between pairs of triple-defect logical qubits via braiding.
A technique for realizing a universal set of fault-tolerant quantum operations is the code switching method, which leverages two quantum codes with complementary sets of transversal gates. To date, the application of this technique has been largely limited to families of color codes supporting a logical
T gate. No analogous code switching protocols exist for many other prominent families, such as rotated surface codes, or for finer
Z-rotation gates. In this work, we first utilize the doubling technique as a unified framework to construct a class of quantum color codes encoding a single logical qubit with an arbitrarily large minimum distance, enabling the transversal realization of arbitrary small logical
Z-rotation gates. We investigate the structural properties of this code family, demonstrating that they improve upon the parameters of state-of-the-art triorthogonal codes, achieve lower qubit overhead compared to certain known color codes, and admit single-shot decoding of
Z-syndromes via meta-checks. Furthermore, we show that this framework extends beyond color codes; specifically, it enables the generation of
r-orthogonal quantum codes,
r≥2, that inherit the local geometry of rotated surface codes. We then provide an overhead optimization protocol alongside several candidate codes tailored for realizing logical
Z-rotation gates within rotated surface codes. Finally, we extend the fault-tolerant code switching protocol based on transversal CNOT gates to incorporate fault-tolerant realization of
Z-rotation gates at any level of the Clifford hierarchy for geometries compatible with rotated surface codes. We present the first demonstration of fault-tolerant magic state preparation by means of code switching within a distance-three rotated surface code using a total footprint of only 45 physical qubits, and evaluate its performance through a simulation.
Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the code. We consider twists in multiple copies of the 2d surface code and identify necessary and sufficient conditions for considering these twists as anyons: namely that they must be self-inverse and that all charges which can be localised by the twist must be invariant under its associated symmetry. If both of these conditions are satisfied the twist and its set of localisable anyonic charges reproduce the behaviour of an anyonic model belonging to a hierarchy which generalises the Ising anyons. We show that the braiding of these twists results in either (tensor products of) the S gate or (tensor products of) the CZ gate. We also show that for any number of copies of the 2d surface code the application of H gates within a copy and CNOT gates between copies is sufficient to generate all possible twists.