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

Bulletin of the American Physical Society

Changing topology by knotting in the three-dimensional Toric Code

Andrej Mesaroš, Yong Baek Kim, Ying Ran

Published Mar 19, 2013• 0 citations
OpenAlex

Related papers

Topological Stabilizer Codes

Keisuke Fujii

SpringerBriefs in mathematical physics•Jan 1, 2015•0 citations

Changing topology by topological defects in three-dimensional topologically ordered phases

Andrej Mesaroš, Yong Baek Kim, Ying Ran

A hallmark feature of topologically ordered states of matter is the dependence of ground-state degeneracy (GSD) on the topology of the manifold determined by the global shape of the system. Although the topology of a physical system is practically hard to manipulate, recently, it was shown that in certain topologically ordered phases, topological defects can introduce extra topological GSD. Here the topological defects can be viewed as effectively changing the topology of the physical system. Previous studies have been focusing on two spatial dimensions with pointlike topological defects. In three dimensions, linelike topological defects can appear. They are closed loops in the bulk that can be linked and knotted, effectively leading to complex three-dimensional manifolds in certain topologically ordered states. This paper studies the properties of such line defects in a particular context: the lattice dislocations. We give an analytical construction, together with support from exact numerical calculations, for the dependence of the GSD on dislocations of certain doubled versions of the exactly solvable Kitaev's toric code models in both two and three dimensions. We find that the GSD of the 3D model depends only on the total number of dislocation loops, no matter how they are linked or knotted. The results are extended to ${\mathbb{Z}}_{n}$ generalizations of the model. Additionally, we consider the phases in which the crystalline orders are destroyed through proliferation of double dislocations. The resulting phases are shown to host topological orders described by non-Abelian gauge theories.

arXiv:1305.0214•Physical Review B•Jul 30, 2013•35 citations

Topology-Hiding Computation

Tal Moran, Ilan Orlov, Silas Richelson

Lecture notes in computer science•Jan 1, 2015•22 citations

Projecting three-dimensional color codes onto three-dimensional toric codes

Arun B. Aloshious, Pradeep Kiran Sarvepalli

Toric codes and color codes are two important classes of topological codes. Kubica et al. [A. Kubica et al., New J. Phys. 17, 083026 (2015)] showed that any $D$-dimensional color code can be mapped to a finite number of toric codes in $D$ dimensions. We propose an alternate map of three-dimensional (3D) color codes to 3D toric codes with a view to decoding 3D color codes. Our approach builds on Delfosse's result [N. Delfosse, Phys. Rev. A 89, 012317 (2014)] for 2D color codes and exploits the topological properties of these codes. Our result reduces the decoding of 3D color codes to that of 3D toric codes. Bit-flip errors are decoded by projecting on one set of 3D toric codes, while phase-flip errors are decoded by projecting onto another set of 3D toric codes. We use these projections to study the performance of a class of 3D color codes called stacked codes.

arXiv:1606.00960•Physical Review A•Jul 2, 2018•14 citations

Decoding Toric Codes on Three Dimensional Simplical Complexes

Arun B. Aloshious, Pradeep Kiran Sarvepalli

Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric codes over an arbitrary lattice will help in studying the performance of color codes. Furthermore, gauge color codes can also be decoded via 3D toric codes. Motivated by this, we propose an efficient algorithm to decode 3D toric codes on arbitrary lattices (with and without boundaries).

arXiv:1911.06056•IEEE Transactions on Information Theory•Nov 10, 2020•7 citations

Vertex Models and Knot invariants

P. Ramadevi

Texts and readings in physical sciences•Jan 1, 2017•0 citations
A hallmark feature of topologically ordered states of matter is the dependence of ground-state degeneracy (GSD) on the topology of the manifold determined by the global shape of the system. Although the topology of a physical system is practically hard to manipulate, recently, it was shown that in certain topologically ordered phases, topological defects can introduce extra topological GSD. Here the topological defects can be viewed as effectively changing the topology of the physical system. Previous studies have been focusing on two spatial dimensions with pointlike topological defects. In three dimensions, linelike topological defects can appear. They are closed loops in the bulk that can be linked and knotted, effectively leading to complex three-dimensional manifolds in certain topologically ordered states. This paper studies the properties of such line defects in a particular context: the lattice dislocations. We give an analytical construction, together with support from exact numerical calculations, for the dependence of the GSD on dislocations of certain doubled versions of the exactly solvable Kitaev's toric code models in both two and three dimensions. We find that the GSD of the 3D model depends only on the total number of dislocation loops, no matter how they are linked or knotted. The results are extended to Zn{\mathbb{Z}}_{n}Zn​ generalizations of the model. Additionally, we consider the phases in which the crystalline orders are destroyed through proliferation of double dislocations. The resulting phases are shown to host topological orders described by non-Abelian gauge theories.
Toric codes and color codes are two important classes of topological codes. Kubica et al. [A. Kubica et al., New J. Phys. 17, 083026 (2015)] showed that any DDD-dimensional color code can be mapped to a finite number of toric codes in DDD dimensions. We propose an alternate map of three-dimensional (3D) color codes to 3D toric codes with a view to decoding 3D color codes. Our approach builds on Delfosse's result [N. Delfosse, Phys. Rev. A 89, 012317 (2014)] for 2D color codes and exploits the topological properties of these codes. Our result reduces the decoding of 3D color codes to that of 3D toric codes. Bit-flip errors are decoded by projecting on one set of 3D toric codes, while phase-flip errors are decoded by projecting onto another set of 3D toric codes. We use these projections to study the performance of a class of 3D color codes called stacked codes.
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric codes over an arbitrary lattice will help in studying the performance of color codes. Furthermore, gauge color codes can also be decoded via 3D toric codes. Motivated by this, we propose an efficient algorithm to decode 3D toric codes on arbitrary lattices (with and without boundaries).