quantum computation with charge-color permuting twists in qudit color codes

Manoj G. Gowda, Pradeep Kiran Sarvepalli

Published Oct 16, 2021• 0 citations

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-color permuting twists.

Related papers

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

Manoj G. Gowda, Pradeep Kiran Sarvepalli

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.

arXiv:2110.08680Physical Review AFeb 24, 20222 citations

Color codes with twists: Construction and universal-gate-set implementation

Manoj G. Gowda, Pradeep Kiran Sarvepalli

Twists are defects in a lattice that can be used to perform encoded computations. Three basic types of twists can be introduced in color codes: 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 a 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 a 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.

arXiv:2104.03669Physical Review AJul 13, 20212 citations

Quantum computation with generalized dislocation codes

Manoj G. Gowda, Pradeep Kiran Sarvepalli

In this paper, we study quantum computing with twists. Twists are yet another form of defects in a lattice. They arise from dislocations in the lattice and can be used to encode and process quantum information. Surface codes with twists are also called dislocation codes. Hastings and Geller showed that dislocation codes could provide gains in space-time complexity of quantum computation. In this paper, we undertake a detailed study of generalized dislocation codes. We develop the theory of qubit dislocation codes over arbitrary four-valent and bicolorable lattices. We give a construction to introduce twists in such lattices and also study the structure of logical operators. We then study dislocation codes over odd prime dimensions in square lattices. Using the theory developed, we present protocols for implementing a universal gate set in qubit dislocation codes. We also show how to implement the generalized Clifford group in qudit dislocation codes in odd prime dimensions.

Physical Review AOct 29, 20204 citations

Topological color codes over higher alphabet

Pradeep Kiran Sarvepalli

Color codes are a class of topological codes that have come into prominence in the recent years. Like the surface codes the codespace defined by them can be associated to the degenerate ground state of a local Hamiltonian. In addition they can be designed to have an extended set of transversal encoded gates (compared to surface codes) increasing their appeal for fault tolerant quantum computation. In this paper we generalize the color codes to arbitrary prime power alphabet. We show that in the 2D case there exist color codes for which the nonbinary Clifford group can be implemented transversally.

IEEE Information Theory Workshop (ITW)Aug 1, 20109 citations

The boundaries and twist defects of the color code and their applications to topological quantum computation

Markus S. Kesselring, Fernando Pastawski, Jens Eisert +1 more

The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The contributions of this work are threefold. First of all, we build upon the abstract theory of boundaries and domain walls of topological phases of matter to comprehensively catalog the objects realizable in color codes. Together with our classification we also provide lattice representations of these objects which include three new types of boundaries as well as a generating set for all 72 color code twist defects. Our work thus provides an explicit toy model that will help to better understand the abstract theory of domain walls. Secondly, we discover a number of interesting new applications of the cataloged objects for quantum information protocols. These include improved methods for performing quantum computations by code deformation, a new four-qubit error-detecting code, as well as families of new quantum error-correcting codes we call stellated color codes, which encode logical qubits at the same distance as the next best color code, but using approximately half the number of physical qubits. To the best of our knowledge, our new topological codes have the highest encoding rate of local stabilizer codes with bounded-weight stabilizers in two dimensions. Finally, we show how the boundaries and twist defects of the color code are represented by multiple copies of other phases. Indeed, in addition to the well studied comparison between the color code and two copies of the surface code, we also compare the color code to two copies of the three-fermion model. In particular, we find that this analogy offers a very clear lens through which we can view the symmetries of the color code which gives rise to its multitude of domain walls.

arXiv:1806.02820QuantumOct 19, 201859 citations

Twists in Topological Codes

Héctor Bombín

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.

Jan 1, 20160 citations