Topological quantum codes and anyons

Author(s):  
Alexei Kitaev
2015 ◽  
Vol 14 (11) ◽  
pp. 4057-4066 ◽  
Author(s):  
Avaz Naghipour ◽  
Mohammad Ali Jafarizadeh ◽  
Sedaghat Shahmorad

2014 ◽  
Vol 14 (15&16) ◽  
pp. 1424-1440
Author(s):  
Clarice Dias de Albuquerque ◽  
Reginaldo Palazzo Jr. ◽  
Eduardo Brandani da Silva

In this paper we present some classes of topological quantum codes on surfaces with genus $g \geq 2$ derived from hyperbolic tessellations with a specific property. We find classes of codes with distance $d = 3$ and encoding rates asymptotically going to 1, $\frac{1}{2}$ and $\frac{1}{3}$, depending on the considered tessellation. Furthermore, these codes are associated with embedding of complete bipartite graphs. We also analyze the parameters of these codes, mainly its distance, in addition to show a class of codes with distance 4. We also present a class of codes achieving the quantum Singleton bound, possibly the only one existing under this construction.


2010 ◽  
Vol 10 (11&12) ◽  
pp. 956-970
Author(s):  
C. D. Albuquerque ◽  
R. Palazzo Jr. ◽  
E. B. Silva

In this paper we present six classes of topological quantum codes (TQC) on compact surfaces with genus $g\ge 2$. These codes are derived from self-dual, quasi self-dual and denser tessellations associated with embeddings of self-dual complete graphs and complete bipartite graphs on the corresponding compact surfaces. The majority of the new classes has the self-dual tessellations as their algebraic and geometric supporting mathematical structures. Every code achieves minimum distance 3 and its encoding rate is such that $\frac{k}{n} \rightarrow 1$ as $n \rightarrow \infty$, except for the one case where $\frac{k}{n} \rightarrow \frac{1}{3}$ as $n \rightarrow \infty$.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Michael Vasmer ◽  
Dan E. Browne ◽  
Aleksander Kubica

AbstractWe propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, however, we focus on the three-dimensional toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We also numerically benchmark the performance of the decoder in the setting with measurement errors using various noise models. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model. Our work constitutes a step towards finding simple and high-performance decoding strategies for a wide range of quantum low-density parity-check codes.


2020 ◽  
Vol 22 (5) ◽  
pp. 053038
Author(s):  
David Amaro ◽  
Markus Müller ◽  
Amit Kumar Pal

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 959
Author(s):  
Edson Donizete de Carvalho ◽  
Waldir Silva Soares ◽  
Eduardo Brandani da Silva

In this work, we show that an n-dimensional sublattice Λ′=mΛ of an n-dimensional lattice Λ induces a G=Zmn tessellation in the flat torus Tβ′=Rn/Λ′, where the group G is isomorphic to the lattice partition Λ/Λ′. As a consequence, we obtain, via this technique, toric codes of parameters [[2m2,2,m]], [[3m3,3,m]] and [[6m4,6,m2]] from the lattices Z2, Z3 and Z4, respectively. In particular, for n=2, if Λ1 is either the lattice Z2 or a hexagonal lattice, through lattice partition, we obtain two equivalent ways to cover the fundamental cell P0′ of each hexagonal sublattice Λ′ of hexagonal lattices Λ, using either the fundamental cell P0 or the Voronoi cell V0. These partitions allow us to present new classes of toric codes with parameters [[3m2,2,m]] and color codes with parameters [[18m2,4,4m]] in the flat torus from families of hexagonal lattices in R2.


2009 ◽  
Vol 50 (2) ◽  
pp. 023513 ◽  
Author(s):  
C. D. Albuquerque ◽  
R. Palazzo ◽  
E. B. Silva

Sign in / Sign up

Export Citation Format

Share Document