Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2110.08680 · Physical Review A

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

Manoj G. Gowda, Pradeep Kiran Sarvepalli

Published Feb 24, 2022• 2 citations
arXivHTMLPDF

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 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.

DOI
10.1103/physreva.105.022621

Related papers

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.03669•Physical Review A•Jul 13, 2021•2 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 A•Oct 29, 2020•4 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, 2010•10 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, 2016•0 citations

Local equivalence of qudit color codes and toric codes

Arun B. Aloshious, Pradeep Kiran Sarvepalli

In this paper, we study nonbinary toric codes and color codes. While the relationships between the qubit color codes and toric codes have been studied extensively from various perspectives, similar studies for qudit toric codes and color codes are missing. We show that just as in the binary case, qudit color codes can be mapped to qudit toric codes. Qudit color codes are known to have the capability for implementing the generalized Clifford group transversally. The proposed mapping of qudit color codes to toric codes would allow us to port the computational capabilities of the qudit color codes to qudit toric codes. Another application would be to decode qudit color codes via qudit toric codes. Along the way, we show an important structural result for higher-dimensional qudit toric codes. Specifically, we show that the toric codes over prime power dimension can be viewed as a direct sum of copies of codes over the prime dimension. This result simplifies the study of codes over prime power dimension by reducing them to the study of codes over the prime dimension. Furthermore, we provide explicit circuits for the transformation between qudit color codes and toric codes.

Physical Review A•Jul 29, 2019•3 citations

Qudit color codes and gauge color codes in all spatial dimensions

Fern H. E. Watson, Earl T. Campbell, Hussain Anwar +1 more

Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, $d$-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological quantum codes with remarkable transversality properties, can be generalized to the qudit paradigm. In recent developments it was found that in three spatial dimensions a qubit color code can support a transversal non-Clifford gate and that in higher spatial dimensions additional non-Clifford gates can be found, saturating Bravyi and K\"onig's bound [S. Bravyi and R. K\"onig, Phys. Rev. Lett. 111, 170502 (2013)]. Furthermore, by using gauge fixing techniques, an effective set of Clifford gates can be achieved, removing the need for state distillation. We show that the qudit color code can support the qudit analogs of these gates and also show that in higher spatial dimensions a color code can support a phase gate from higher levels of the Clifford hierarchy that can be proven to saturate Bravyi and K\"onig's bound in all but a finite number of special cases. The methodology used is a generalization of Bravyi and Haah's method of triorthogonal matrices [S. Bravyi and J. Haah, Phys. Rev. A 86, 052329 (2012)], which may be of independent interest. For completeness, we show explicitly that the qudit color codes generalize to gauge color codes and share many of the favorable properties of their qubit counterparts.

arXiv:1503.08800•Physical Review A•Aug 7, 2015•45 citations
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.
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.
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.
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.
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.
In this paper, we study nonbinary toric codes and color codes. While the relationships between the qubit color codes and toric codes have been studied extensively from various perspectives, similar studies for qudit toric codes and color codes are missing. We show that just as in the binary case, qudit color codes can be mapped to qudit toric codes. Qudit color codes are known to have the capability for implementing the generalized Clifford group transversally. The proposed mapping of qudit color codes to toric codes would allow us to port the computational capabilities of the qudit color codes to qudit toric codes. Another application would be to decode qudit color codes via qudit toric codes. Along the way, we show an important structural result for higher-dimensional qudit toric codes. Specifically, we show that the toric codes over prime power dimension can be viewed as a direct sum of copies of codes over the prime dimension. This result simplifies the study of codes over prime power dimension by reducing them to the study of codes over the prime dimension. Furthermore, we provide explicit circuits for the transformation between qudit color codes and toric codes.
Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, ddd-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological quantum codes with remarkable transversality properties, can be generalized to the qudit paradigm. In recent developments it was found that in three spatial dimensions a qubit color code can support a transversal non-Clifford gate and that in higher spatial dimensions additional non-Clifford gates can be found, saturating Bravyi and K\"onig's bound [S. Bravyi and R. K\"onig, Phys. Rev. Lett. 111, 170502 (2013)]. Furthermore, by using gauge fixing techniques, an effective set of Clifford gates can be achieved, removing the need for state distillation. We show that the qudit color code can support the qudit analogs of these gates and also show that in higher spatial dimensions a color code can support a phase gate from higher levels of the Clifford hierarchy that can be proven to saturate Bravyi and K\"onig's bound in all but a finite number of special cases. The methodology used is a generalization of Bravyi and Haah's method of triorthogonal matrices [S. Bravyi and J. Haah, Phys. Rev. A 86, 052329 (2012)], which may be of independent interest. For completeness, we show explicitly that the qudit color codes generalize to gauge color codes and share many of the favorable properties of their qubit counterparts.