If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following: (i) equivelar maps of type $ [k^k]$, (ii) equivelar maps on the double torus along with the covering of the maps, and (iii) semi-equivelar maps on the surface of \Echar{-1}, along with {their} covering maps. The encoding rate of the class of codes associated with the maps in (i) is such that $ \frac{k}{n}\rightarrow 1 $ as $ n\rightarrow\infty $, and for the remaining classes of codes, the encoding rate is $ \frac{k}{n}\rightarrow α$ as $ n\rightarrow \infty $ with $ α< 1 $.If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following: (i) equivelar maps of type $ [k^k]$, (ii) equivelar maps on the double torus along with the covering of the maps, and (iii) semi-equivelar maps on the surface of \Echar{-1}, along with {their} covering maps. The encoding rate of the class of codes associated with the maps in (i) is such that $ \frac{k}{n}\rightarrow 1 $ as $ n\rightarrow\infty $, and for the remaining classes of codes, the encoding rate is $ \frac{k}{n}\rightarrow α$ as $ n\rightarrow \infty $ with $ α< 1 $.

arXiv:2007.01684Jul 3, 20200 citations

New quantum codes from two linear codes

Xiusheng Liu, Peng Hu

Quantum Information ProcessingJan 11, 202029 citations

New classes of TQC associated with self-dual, quasi self-dual and denser tessellations

Clarice Dias de Albuquerque, Reginaldo Palazzo, Eduardo Brandani da 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$ .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$.

Quantum Information and ComputationNov 1, 20109 citations

A new take on permutation-invariant quantum codes

Yingkai Ouyang

May 13, 20242 citations

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

n \rightarrow \infty

, except for the one case where

\frac{k}{n} \rightarrow \frac{1}{3}

n \rightarrow \infty