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• 1 citation
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 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

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

New constructions of entanglement-assisted quantum MDS codes from negacyclic codes

Ruihu Li, Guanmin Guo, Hao Song +1 more

When constructing quantum codes under the entanglement-assisted (EA) stabilizer formalism, one can ignore the limitation of dual-containing condition. This allows us to construct EA quantum error-correcting codes (QECCs) from any classical linear codes. The main contribution of this manuscript is to make a general statement for determining the optimal number of pre-shared qubits instead of presenting only specific cases. Let [Formula: see text] and [Formula: see text], where [Formula: see text] is an odd prime power, [Formula: see text] and [Formula: see text]. By deeply investigating the decomposition of the defining set of negacyclic codes, we generalize the number of pre-shared entanglement pairs of Construction (1) in Lu et al. [Quantom Inf. Process. 17 (2018) 69] from [Formula: see text] to arbitrary even numbers less than or equal to [Formula: see text]. Consequently, a series of EA quantum maximum distance separable (EAQMDS) codes can be produced. The absolute majority of them are new and the minimum distance can be up to [Formula: see text]. Moreover, this method can be applied to construct many other families of EAQECCs with good parameters, especially large minimum distance.

International Journal of Quantum Information•Apr 1, 2019•17 citations

A new method for constructing EAQEC MDS codes

Peng Hu, Xiusheng Liu

Entanglement-assisted quantum error-correcting (EAQEC) codes make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQEC code from any classical linear code, unlike standard quantum error-correcting codes, which can only be constructed from dual-containing codes. However, the number $c$ of pre-shared maximally entangled states is usually calculated by computer search. In this paper, we first give a new formula for calculating the number $c$ of pre-shared maximally entangled states. Then, using this formula, we construct three classes of new entanglement-assisted quantum error-correcting maximum-distance-separable ( EAQEC MDS) codes.

arXiv:2003.00843•Mar 2, 2020•2 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.
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)
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.
When constructing quantum codes under the entanglement-assisted (EA) stabilizer formalism, one can ignore the limitation of dual-containing condition. This allows us to construct EA quantum error-correcting codes (QECCs) from any classical linear codes. The main contribution of this manuscript is to make a general statement for determining the optimal number of pre-shared qubits instead of presenting only specific cases. Let [Formula: see text] and [Formula: see text], where [Formula: see text] is an odd prime power, [Formula: see text] and [Formula: see text]. By deeply investigating the decomposition of the defining set of negacyclic codes, we generalize the number of pre-shared entanglement pairs of Construction (1) in Lu et al. [Quantom Inf. Process. 17 (2018) 69] from [Formula: see text] to arbitrary even numbers less than or equal to [Formula: see text]. Consequently, a series of EA quantum maximum distance separable (EAQMDS) codes can be produced. The absolute majority of them are new and the minimum distance can be up to [Formula: see text]. Moreover, this method can be applied to construct many other families of EAQECCs with good parameters, especially large minimum distance.
Entanglement-assisted quantum error-correcting (EAQEC) codes make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQEC code from any classical linear code, unlike standard quantum error-correcting codes, which can only be constructed from dual-containing codes. However, the number ccc of pre-shared maximally entangled states is usually calculated by computer search. In this paper, we first give a new formula for calculating the number ccc of pre-shared maximally entangled states. Then, using this formula, we construct three classes of new entanglement-assisted quantum error-correcting maximum-distance-separable ( EAQEC MDS) codes.