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

Journal of Physics Conference Series

Construction of entanglement-assisted quantum MDS codes

Guanmin Guo, Ruihu Li, Youliang Zheng, Zhang Mao

Published Nov 1, 2020• 0 citations
Publisher

Abstract

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)

DOI
10.1088/1742-6596/1684/1/012040

Related papers

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

Some New Classes of Entanglement-assisted Quantum MDS Codes from generalized Reed-Solomon Codes.

Renjie Jin, Yiran Cao, Yu Jiang +1 more

In this paper, we produce some new classes of entanglement-assisted quantum MDS codes(EAQMDS codes for short) via generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many EAQMDS codes with new lengths which have never been reported. Moreover, some of them have larger minimum distance than known results.

•Oct 13, 2019•0 citations

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs

Weijun Fang, Fang-Wei Fu, Lanqiang Li +1 more

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.

arXiv:1812.09019•IEEE Transactions on Information Theory•Oct 30, 2019•114 citations

Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance

Liangdong Lü, Wenping Ma, Ruihu Li +3 more

The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of q-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of q-ary EAQMDS have minimum distance upper bound greater than 3q−1. Some of them have much larger minimum distance than the known quantum MDS (QMDS) codes of the same length. Most of these q-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.

arXiv:1803.04168•Finite Fields and Their Applications•Jul 20, 2018•67 citations

Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1

Jihao Fan, Hanwu Chen, Juan Xu

he entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum MDS (EAQMDS) codes based on classical MDS codes by exploiting one or more pre-shared maximally entangled states. We show that these EAQMDS codes have much larger minimum distance than the standard quantum MDS (QMDS) codes of the same length, and three classes of these EAQMDS codes consume only one pair of maximally entangled states.

arXiv:1602.02235•Quantum Information and Computation•Apr 1, 2016•61 citations

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
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)
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.
In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It turns out that the dimensions of Euclidean hulls or Hermitian hulls of the codes in our constructions can take all or almost all possible values. As a consequence, we can apply our results to entanglement-assisted quantum error-correcting codes (EAQECCs) and obtain several new families of MDS EAQECCs with flexible parameters. The required number of maximally entangled states of these MDS EAQECCs can take all or almost all possible values. Moreover, several new classes of q-ary MDS EAQECCs of length n > q+1 are also obtained.
The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this work, we propose a decomposition of the defining set of constacyclic codes. Using this method, we construct four classes of q-ary entanglement-assisted quantum MDS (EAQMDS) codes based on classical constacyclic MDS codes by exploiting less pre-shared maximally entangled states. We show that a class of q-ary EAQMDS have minimum distance upper bound greater than 3q−1. Some of them have much larger minimum distance than the known quantum MDS (QMDS) codes of the same length. Most of these q-ary EAQMDS codes are new in the sense that their parameters are not covered by the codes available in the literature.
he entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum MDS (EAQMDS) codes based on classical MDS codes by exploiting one or more pre-shared maximally entangled states. We show that these EAQMDS codes have much larger minimum distance than the standard quantum MDS (QMDS) codes of the same length, and three classes of these EAQMDS codes consume only one pair of maximally entangled states.
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.