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

Quantum Information and Computation

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

Clarice Dias de Albuquerque, Reginaldo Palazzo, Eduardo Brandani da Silva

Published Nov 1, 2010• 9 citations
Publisher

Abstract

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

DOI
10.26421/qic10.11-12-6

Related papers

New classes of topological quantum codes derived from embeddings of graphs on compact surfaces

Clarice Dias de Albuquerque, Reginaldo Palazzo, Eduardo Brandani da Silva

In this paper we present classes of topological quantum codes (TQC) derived from the embedding of complete bipartite graphs on the corresponding compact surfaces. Every code achieves minimum distance 3 and its encoding rate is such that k/n → 1 as n → ∞.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•0 citations

Topological quantum codes on compact surfaces with genus g≥2

Clarice Dias de Albuquerque, Reginaldo Palazzo, E.B. Da Silva

In this paper we propose a construction procedure of a class of topological quantum error-correcting codes on surfaces with genus g≥2. This generalizes the toric codes construction. We also tabulate all possible surface codes with genus 2–5. In particular, this construction reproduces the class of codes obtained when considering the embedding of complete graphs Ks, for s≡1 mod 4, on surfaces with appropriate genus. We also show a table comparing the rate of different codes when fixing the distance to 3–5.

Journal of Mathematical Physics•Feb 1, 2009•42 citations

On geometrically uniform codes and topological quantum MDS codes

Vandenberg Lopes Vieira, S. O. Juriaans

In this paper, we present generalized edge-pairings for the family of hyperbolic tessellations {4λ, 4} with the purpose of obtaining the corresponding discrete group of isometries. These tessellations have greater density packing than the self-dual tessellations {4λ, 4λ}, implying that the associated codes achieve the least error probability or, equivalently, that these codes are optimum codes. We also consider the topological quantum error-correcting codes on surfaces with genus g ≥ 2, as proposed in other papers. From that, we focus on the class of topological quantum maximum distance separable codes, showing that the only such codes are precisely the ones with minimum distance d ≤ 2.

Journal of Mathematical Physics•Sep 1, 2022•1 citation

Topological quantum codes from self-complementary self-dual graphs

Avaz Naghipour, M. A. Jafarizadeh, S. Shahmorad

In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a prime number and r is a positive integer. The parameters of two new classes of quantum codes are [[(2k+2)(8k+ 7); 2(8k^2+7k); d]] and [[(2k+2)(8k+9); 2(8k^2+9k+1); d]] respectively, where d>=3. For these quantum codes, the code rate approaches 1 as k goes to infinity.

arXiv:1503.05710•Mar 19, 2015•0 citations

Hyperbolic quantum color codes

Eduardo Brandani da Silva, Waldir Silva Soares

Current work presents a new approach to quantum color codes on compact surfaces with genus $g \geq 2$ using the identification of these surfaces with hyperbolic polygons and hyperbolic tessellations. We show that this method may give rise to color codes with a very good parameters and we present tables with several examples of these codes whose parameters had not been shown before. We also present a family of codes with minimum distance $d=4$ and the encoding rate asymptotically going to 1 while $n \rightarrow \infty$.

arXiv:1804.06382•Apr 17, 2018•1 citation

Construction of quantum codes based on self-dual orientable embeddings of complete multipartite graphs complete multipartite graphs

Avaz Naghipour, M. A. Jafarizadeh, S. Shahmorad

This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the com- plete graphs K4r+1 and K4s and by current graphs and rotation schemes. and s are both divisible by 4.

arXiv:1507.01536•Jul 6, 2015•0 citations
In this paper we present six classes of topological quantum codes (TQC) on compact surfaces with genus g≥2g\ge 2g≥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 kn→1\frac{k}{n} \rightarrow 1nk​→1 as n→∞n \rightarrow \inftyn→∞, except for the one case where kn→13\frac{k}{n} \rightarrow \frac{1}{3}nk​→31​ as n→∞n \rightarrow \inftyn→∞.
In this paper we propose a construction procedure of a class of topological quantum error-correcting codes on surfaces with genus g≥2. This generalizes the toric codes construction. We also tabulate all possible surface codes with genus 2–5. In particular, this construction reproduces the class of codes obtained when considering the embedding of complete graphs Ks, for s≡1 mod 4, on surfaces with appropriate genus. We also show a table comparing the rate of different codes when fixing the distance to 3–5.
In this paper, we present generalized edge-pairings for the family of hyperbolic tessellations {4λ, 4} with the purpose of obtaining the corresponding discrete group of isometries. These tessellations have greater density packing than the self-dual tessellations {4λ, 4λ}, implying that the associated codes achieve the least error probability or, equivalently, that these codes are optimum codes. We also consider the topological quantum error-correcting codes on surfaces with genus g ≥ 2, as proposed in other papers. From that, we focus on the class of topological quantum maximum distance separable codes, showing that the only such codes are precisely the ones with minimum distance d ≤ 2.
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a prime number and r is a positive integer. The parameters of two new classes of quantum codes are [[(2k+2)(8k+ 7); 2(8k^2+7k); d]] and [[(2k+2)(8k+9); 2(8k^2+9k+1); d]] respectively, where d>=3. For these quantum codes, the code rate approaches 1 as k goes to infinity.
Current work presents a new approach to quantum color codes on compact surfaces with genus g≥2g \geq 2g≥2 using the identification of these surfaces with hyperbolic polygons and hyperbolic tessellations. We show that this method may give rise to color codes with a very good parameters and we present tables with several examples of these codes whose parameters had not been shown before. We also present a family of codes with minimum distance d=4d=4d=4 and the encoding rate asymptotically going to 1 while n→∞n \rightarrow \inftyn→∞.