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 entanglement-assisted quantum MDS codes derived from cyclic codes

Sujuan Huang, Shixin Zhu, Pan Wang

Published Apr 1, 2023• 0 citations
Publisher

Abstract

Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[\frac{{{q^2} - 1}}{a},\frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am \pm \ell$, $a = \frac{{\ell^2} - 1}{3}$ is an odd integer, $\ell \equiv 2\ (\bmod\ 6)$ or $\ell \equiv 4\ (\bmod\ 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.

DOI
10.26421/qic23.5-6-4

Related papers

New entanglement-assisted MDS quantum constacyclic codes

Hangyu Liu, Sujuan Huang, Liqi Wang +1 more

Entanglement-assisted quantum error-correcting codes can be seen as a new-type of quantum error-correcting codes and can be constructed from arbitrary linear codes which should not satisfy the dual-containing condition by utilizing shared entangled states between the sender and the receiver in advance. In this paper, we construct several new classes of entanglement-assisted quantum maximum-distance-separable codes from constacyclic codes and cyclic codes by exploiting small pre-shared entangled states, respectively. These codes are new in the sense that they are not covered by the codes available in the literature.

Quantum Information and Computation•Sep 1, 2024•0 citations

New entanglement-assisted quantum codes from negacyclic codes

Xiaojing Chen, Xingbo Lu, Shixin Zhu +2 more

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality condition and utilizing preshared entanglement between the sender and receiver. In this paper, a new family of EAQECCs is constructed from negacyclic codes of length $n=\frac{q^2+1}{a}$, where $q$ is an odd prime power, $a=\frac{m^2+1}{2}$ and $m$ is an odd integer. Some new entanglement-assisted quantum maximum distance separable (EAQMDS) codes are obtained in the sense that their parameters are not covered by the previously known ones.

arXiv:2305.08517•May 15, 2023•0 citations

Cyclic codes and some new entanglement-assisted quantum MDS codes

Wan Jiang, Shixin Zhu, Xiaojing Chen

Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable (EAQMDS) codes with flexible parameters has received much attention. In this work, four families of EAQMDS codes with a more general length are presented. And the method of selecting defining set is different from others. Compared with all the previously known results, the EAQMDS codes we constructed have larger minimum distance. All of these EAQMDS codes are new in the sense that their parameters are not covered by the quantum codes available in the literature.

arXiv:2009.07422•Sep 16, 2020•0 citations

Some New Classes of Entanglement-Assisted Quantum MDS Codes Derived From Constacyclic Codes

Jian‐Zhang Chen, Youqin Chen, Chunhui Feng +2 more

Although quantum maximal-distance-separable (MDS) codes that satisfy the quantum singleton bound have become an important research topic in the quantum coding theory, it is not an easy task to search for quantum MDS codes with the minimum distance that is larger than (q/2) + 1. The pre-shared entanglement between the sender and the receiver can improve the minimum distance of quantum MDS codes such that the minimum distance of some constructed codes achieves (q/2) + 1 or exceeds (q/2) + 1. Meanwhile, how to determine the required number of maximally entangled states to make the minimum distance of quantum MDS codes larger than (q/2) + 1 is an interesting problem in the quantum coding theory. In this paper, we utilize the decomposition of the defining set and q2-cyclotomic cosets of constacyclic codes with the form q = αm + t or q = αm + α - t and n = (q2+ 1/α) to construct some new families of entanglement-assisted quantum MDS codes that satisfy the entanglement-assisted quantum singleton bound, where q is an odd prime power and m is a positive integer, while both α and t are positive integers such that α = t2+ 1. The parameters of these codes constructed in this paper are more general compared with the ones in the literature. Moreover, the minimum distance of some codes in this paper is larger than (q/2) + 1 or q + 1.

IEEE Access•Jan 1, 2019•6 citations

New entanglement-assisted quantum MDS codes

Binbin Pang, Shixin Zhu, Liqi Wang

Entanglement-assisted quantum error-correcting codes (EAQECCs) can be obtained from arbitrary classical linear codes based on the entanglement-assisted stabilizer formalism, which greatly promoted the development of quantum coding theory. In this paper, we construct several families of [Formula: see text]-ary entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes of lengths [Formula: see text] with flexible parameters as to the minimum distance [Formula: see text] and the number [Formula: see text] of maximally entangled states. Most of the obtained EAQMDS codes have larger minimum distances than the codes available in the literature.

International Journal of Quantum Information•Apr 1, 2021•6 citations

Construction of entanglement-assisted quantum MDS codes

Guanmin Guo, Ruihu Li, Youliang Zheng +1 more

Abstract Entanglement-assisted quantum error correction codes (EAQEECs) can improve the reliability of transmission, which make use of pre-existing entanglement between two parties. In this paper, we construct two classes of entanglement-assisted quantum maximum distance separable (EAQMDS) codes via generalized Reed-Solomon (GRS) codes. Consequently, the results show that some of these EAQMDS codes have much larger minimum distance than ones available in the literature. Meanwhile, many of these EAQMDS codes are new in the sense that the parameters of these codes are not covered by the previously known ones. (Abstract)

Journal of Physics Conference Series•Nov 1, 2020•0 citations
Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters [[q2−1a,q2−1a−2d+2+c,d;c]]q[[\frac{{{q^2} - 1}}{a},\frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q[[aq2−1​,aq2−1​−2d+2+c,d;c]]q​, where qqq is a prime power with the form q=am±ℓq = am \pm \ellq=am±ℓ, a=ℓ2−13a = \frac{{\ell^2} - 1}{3}a=3ℓ2−1​ is an odd integer, ℓ≡2 ( mod  6)\ell \equiv 2\ (\bmod\ 6)ℓ≡2 (mod 6) or ℓ≡4 ( mod  6)\ell \equiv 4\ (\bmod\ 6)ℓ≡4 (mod 6), and mmm is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.
Entanglement-assisted quantum error-correcting codes can be seen as a new-type of quantum error-correcting codes and can be constructed from arbitrary linear codes which should not satisfy the dual-containing condition by utilizing shared entangled states between the sender and the receiver in advance. In this paper, we construct several new classes of entanglement-assisted quantum maximum-distance-separable codes from constacyclic codes and cyclic codes by exploiting small pre-shared entangled states, respectively. These codes are new in the sense that they are not covered by the codes available in the literature.
The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality condition and utilizing preshared entanglement between the sender and receiver. In this paper, a new family of EAQECCs is constructed from negacyclic codes of length n=q2+1an=\frac{q^2+1}{a}n=aq2+1​, where qqq is an odd prime power, a=m2+12a=\frac{m^2+1}{2}a=2m2+1​ and mmm is an odd integer. Some new entanglement-assisted quantum maximum distance separable (EAQMDS) codes are obtained in the sense that their parameters are not covered by the previously known ones.
Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable (EAQMDS) codes with flexible parameters has received much attention. In this work, four families of EAQMDS codes with a more general length are presented. And the method of selecting defining set is different from others. Compared with all the previously known results, the EAQMDS codes we constructed have larger minimum distance. All of these EAQMDS codes are new in the sense that their parameters are not covered by the quantum codes available in the literature.
Although quantum maximal-distance-separable (MDS) codes that satisfy the quantum singleton bound have become an important research topic in the quantum coding theory, it is not an easy task to search for quantum MDS codes with the minimum distance that is larger than (q/2) + 1. The pre-shared entanglement between the sender and the receiver can improve the minimum distance of quantum MDS codes such that the minimum distance of some constructed codes achieves (q/2) + 1 or exceeds (q/2) + 1. Meanwhile, how to determine the required number of maximally entangled states to make the minimum distance of quantum MDS codes larger than (q/2) + 1 is an interesting problem in the quantum coding theory. In this paper, we utilize the decomposition of the defining set and q2-cyclotomic cosets of constacyclic codes with the form q = αm + t or q = αm + α - t and n = (q2+ 1/α) to construct some new families of entanglement-assisted quantum MDS codes that satisfy the entanglement-assisted quantum singleton bound, where q is an odd prime power and m is a positive integer, while both α and t are positive integers such that α = t2+ 1. The parameters of these codes constructed in this paper are more general compared with the ones in the literature. Moreover, the minimum distance of some codes in this paper is larger than (q/2) + 1 or q + 1.
Entanglement-assisted quantum error-correcting codes (EAQECCs) can be obtained from arbitrary classical linear codes based on the entanglement-assisted stabilizer formalism, which greatly promoted the development of quantum coding theory. In this paper, we construct several families of [Formula: see text]-ary entanglement-assisted quantum maximum-distance-separable (EAQMDS) codes of lengths [Formula: see text] with flexible parameters as to the minimum distance [Formula: see text] and the number [Formula: see text] of maximally entangled states. Most of the obtained EAQMDS codes have larger minimum distances than the codes available in the literature.
Abstract Entanglement-assisted quantum error correction codes (EAQEECs) can improve the reliability of transmission, which make use of pre-existing entanglement between two parties. In this paper, we construct two classes of entanglement-assisted quantum maximum distance separable (EAQMDS) codes via generalized Reed-Solomon (GRS) codes. Consequently, the results show that some of these EAQMDS codes have much larger minimum distance than ones available in the literature. Meanwhile, many of these EAQMDS codes are new in the sense that the parameters of these codes are not covered by the previously known ones. (Abstract)