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

Topological quantum codes from self-complementary self-dual graphs

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

Published Mar 19, 2015• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1503.05710

Related papers

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

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

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

On Galois hulls of linear codes and new entanglement-assisted quantum error-correcting codes

Yang Li, Shixin Zhu

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new $q$-ary or $\sqrt{q}$-ary EAQECCs and MDS EAQECCs with rates greater than or equal to $\frac{1}{2}$ and positive net rates can be obtained. Moreover, the minimum distance of many $\sqrt{q}$-ary MDS EAQECCs of length $n>\sqrt{q}+1$ is greater than or equal to $\lceil \frac{\sqrt{q}}{2} \rceil$.

arXiv:2207.02535•Jul 6, 2022•0 citations

New quantum codes from self-dual codes over F_4

Reza Dastbasteh, Petr Lisoněk

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of $0$-dimensional binary quantum codes is provided. We give minimum distance lower bounds for our quantum codes in terms of the minimum distance of their ingredient linear codes. We also present new results on the minimum distance of linear cyclic codes using their fixed subcodes. Finally, we list many new record-breaking quantum codes obtained from our constructions.

arXiv:2211.00891•Nov 2, 2022•1 citation

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•30 citations
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.
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→∞.
The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the dimensions of Galois hulls of linear codes is found. Some new necessary and sufficient conditions for linear codes being Galois self-orthogonal codes, Galois self-dual codes, and Galois linear complementary dual codes are characterized. Then, we propose explicit methods to construct Galois self-orthogonal codes of larger length from given Galois self-orthogonal codes. As an application, linear codes of larger length with Galois hulls of arbitrary dimensions are further derived. Focusing on the Hermitian inner product, two new classes of Hermitian self-orthogonal maximum distance separable (MDS) codes are also constructed. Finally, applying all the results to the construction of entanglement-assisted quantum error-correcting codes (EAQECCs), many new qqq-ary or q\sqrt{q}q​-ary EAQECCs and MDS EAQECCs with rates greater than or equal to 12\frac{1}{2}21​ and positive net rates can be obtained. Moreover, the minimum distance of many q\sqrt{q}q​-ary MDS EAQECCs of length n>q+1n>\sqrt{q}+1n>q​+1 is greater than or equal to ⌈q2⌉\lceil \frac{\sqrt{q}}{2} \rceil⌈2q​​⌉.
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of 000-dimensional binary quantum codes is provided. We give minimum distance lower bounds for our quantum codes in terms of the minimum distance of their ingredient linear codes. We also present new results on the minimum distance of linear cyclic codes using their fixed subcodes. Finally, we list many new record-breaking quantum codes obtained from our constructions.
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.