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:1507.01536

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

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

Published Jul 6, 2015• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1507.01536

Related papers

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

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

Binary Construction of Quantum Codes of Minimum Distance Three and Four

Ruihu Li, Xinran Li

We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.

IEEE Transactions on Information Theory•Jun 1, 2004•68 citations

New binary quantum codes from Hermitian dual-containing Quasi-cyclic codes

Liangdong Lü, Gaochi Zhang, FENG Ganyu +1 more

In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over $G F(4)$. By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations

On Self-Dual Quantum Codes, Graphs, and Boolean Functions

Lars Eirik Danielsen

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond to equivalent quantum codes if they are related by a sequence of local complementations. We use this operation to generate orbits of graphs, and thus classify all inequivalent self-dual additive codes over GF(4) of length up to 12, where previously only all codes of length up to 9 were known. We show that these codes can be interpreted as quadratic Boolean functions, and we define non-quadratic quantum codes, corresponding to Boolean functions of higher degree. We look at various cryptographic properties of Boolean functions, in particular the propagation criteria. The new aperiodic propagation criterion (APC) and the APC distance are then defined. We show that the distance of a zero-dimensional quantum code is equal to the APC distance of the corresponding Boolean function. Orbits of Boolean functions with respect to the {I,H,N}^n transform set are generated. We also study the peak-to-average power ratio with respect to the {I,H,N}^n transform set (PAR_IHN), and prove that PAR_IHN of a quadratic Boolean function is related to the size of the maximum independent set over the corresponding orbit of graphs. A construction technique for non-quadratic Boolean functions with low PAR_IHN is proposed. It is finally shown that both PAR_IHN and APC distance can be interpreted as partial entanglement measures.

arXiv:quant-ph/0503236•Mar 31, 2005•49 citations
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.
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→∞.
We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.
In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over GF(4)G F(4)GF(4). By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond to equivalent quantum codes if they are related by a sequence of local complementations. We use this operation to generate orbits of graphs, and thus classify all inequivalent self-dual additive codes over GF(4) of length up to 12, where previously only all codes of length up to 9 were known. We show that these codes can be interpreted as quadratic Boolean functions, and we define non-quadratic quantum codes, corresponding to Boolean functions of higher degree. We look at various cryptographic properties of Boolean functions, in particular the propagation criteria. The new aperiodic propagation criterion (APC) and the APC distance are then defined. We show that the distance of a zero-dimensional quantum code is equal to the APC distance of the corresponding Boolean function. Orbits of Boolean functions with respect to the {I,H,N}^n transform set are generated. We also study the peak-to-average power ratio with respect to the {I,H,N}^n transform set (PAR_IHN), and prove that PAR_IHN of a quadratic Boolean function is related to the size of the maximum independent set over the corresponding orbit of graphs. A construction technique for non-quadratic Boolean functions with low PAR_IHN is proposed. It is finally shown that both PAR_IHN and APC distance can be interpreted as partial entanglement measures.