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

Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials

Tao Zhang, Gennian Ge

Published Aug 5, 2015• 2 citations
arXivHTMLPDF

Abstract

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available in the literature. Meanwhile, we give a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.

DOI
10.48550/arxiv.1508.00974

Related papers

Quantum Codes Derived From Certain Classes of Polynomials

Tao Zhang, Gennian Ge

One central theme in quantum error-correction is to construct quantum codes that have a relatively large minimum distance. In this paper, we first present a construction of classical linear codes based on certain classes of polynomials. Through these classical linear codes, we are able to obtain some new quantum codes. It turns out that some of the quantum codes exhibited here have better parameters than the ones available in the literature.

IEEE Transactions on Information Theory•Sep 21, 2016•14 citations

A new family of quantum synchronizable codes from negacyclic codes

Tao Wang, Tongjiang Yan, Sun, Shiwen

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum synchronizable codes from negacyclic codes are proposed, where the length of these negacyclic codes are $p$ and $pq$. Through this method, the quantum synchronizable code possesses optimal or almost optimal error-correcting capability towards bits errors and phase errors, since the negacyclic codes we used are optimal or almost optimal. Moreover, this paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.

arXiv:2107.02648•Jul 6, 2021•0 citations

A New Family of Quantum Synchronizable Codes

Xia Li, Qin Yue

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct a family of QSCs from cyclic codes. The best attainable misalignment tolerance can also be achieved under certain constraints. And we give two classes of specific constructions of QSCs, which achieve the best attainable misalignment tolerance. Moreover, the second class of QSCs possess good error-correcting capability towards bit errors and phase errors.

IEEE Communications Letters•Sep 30, 2020•10 citations

Quantum Synchronizable Codes From Finite Geometries

Yuichiro Fujiwara, Peter Vandendriessche

Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that, in principle, such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic 2, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.

arXiv:1311.3416•IEEE Transactions on Information Theory•Sep 10, 2014•32 citations

Quantum Synchronizable Codes From Cyclotomic Classes of Order Two over $\mathbb{Z}_{2q}$

Tao Wang, Tongjiang Yan, Sidorenko, Vladimir +1 more

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes of quantum synchronizable codes by the cyclotomic classes of order two over $\mathbb{Z}_{2q}$, whose synchronization capabilities can reach the upper bound under certain conditions. Moreover, the quantum synchronizable codes possess good error-correcting capability towards bit errors and phase errors.

arXiv:2106.02470•Jun 4, 2021•1 citation

A class of quantum synchronizable codes of length $2^n$ over ${\rm F}_q$

Shiwen Sun, Tongjiang Yan, Yuhua Sun +2 more

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes which can be used to correct the effects of quantum noise on qubits and misalignment in block synchronization. In this paper, a new class of quantum synchronizable codes of length $2^n$ are constructed by using the cyclotomic cosets, whose synchronization capabilities always reach the upper bound $2^n$.

arXiv:2110.13659•Oct 25, 2021•0 citations
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical codes, we are able to obtain some new quantum codes. It turns out that some of quantum codes exhibited here have better parameters than the ones available in the literature. Meanwhile, we give a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum synchronizable codes from negacyclic codes are proposed, where the length of these negacyclic codes are ppp and pqpqpq. Through this method, the quantum synchronizable code possesses optimal or almost optimal error-correcting capability towards bits errors and phase errors, since the negacyclic codes we used are optimal or almost optimal. Moreover, this paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.
Quantum synchronizable codes (QSCs) are special quantum error-correcting codes that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct a family of QSCs from cyclic codes. The best attainable misalignment tolerance can also be achieved under certain constraints. And we give two classes of specific constructions of QSCs, which achieve the best attainable misalignment tolerance. Moreover, the second class of QSCs possess good error-correcting capability towards bit errors and phase errors.
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that, in principle, such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic 2, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.
Quantum Synchronizable Codes From Cyclotomic Classes of Order Two over Z2q\mathbb{Z}_{2q}Z2q​
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes of quantum synchronizable codes by the cyclotomic classes of order two over Z2q\mathbb{Z}_{2q}Z2q​, whose synchronization capabilities can reach the upper bound under certain conditions. Moreover, the quantum synchronizable codes possess good error-correcting capability towards bit errors and phase errors.
A class of quantum synchronizable codes of length 2n2^n2n over Fq{\rm F}_qFq​
Quantum synchronizable codes (QSCs) are special quantum error-correcting codes which can be used to correct the effects of quantum noise on qubits and misalignment in block synchronization. In this paper, a new class of quantum synchronizable codes of length 2n2^n2n are constructed by using the cyclotomic cosets, whose synchronization capabilities always reach the upper bound 2n2^n2n.