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:1503.05710 · Quantum Information Processing

Topological quantum codes from self-complementary self-dual graphs

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

Published Sep 3, 2015• 7 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1115-9

Related papers

Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphs

Avaz Naghipour, M. A. Jafarizadeh

Quantum Information Processing•Oct 27, 2017•0 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$.

Quantum Information and Computation•Nov 1, 2010•9 citations

Topological Quantum Codes

Clarice Dias de Albuquerque, Eduardo Brandani da Silva, Waldir Silva Soares

SpringerBriefs in mathematics•Jan 1, 2022•0 citations

Quantum Codes for Topological Quantum Computation

Clarice Dias de Albuquerque, Eduardo Brandani da Silva, Waldir Silva Soares

SpringerBriefs in mathematics•Jan 1, 2022•4 citations

Self-dual Codes Defined on Factor Graphs

汪辉松, 汪隽, Qun Du +1 more

A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.

上海交通大学学报:英文版•Jan 1, 2007•0 citations

Topological quantum codes and anyons

Alexei Kitaev

Proceedings of symposia in applied mathematics•Jan 1, 2002•9 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→∞.
A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.