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

International Conference on Network and Information Systems for Computers (ICNISC)

Construction of Maximal Entanglement EAQECCs of Distance 4 from Caps in Projective Space PG(r,4)

Qiang Fu, Ruihu Li, Liangdong Lv, Yang Liu

Published Apr 1, 2017• 1 citation
Publisher

Abstract

The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using a decomposition of the 126-cap in PG(5,4), we firstly constructed LCD n-cap with 6The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using a decomposition of the 126-cap in PG(5,4), we firstly constructed LCD n-cap with 6≤n≤120. From these LCD caps, we then derived the related maximal entanglement [[n, n-6,4;6]] EAQECCs. Finally, using LCD LCD subcaps of 126-cap obtained, we constructed maximal entanglement EAQECCs with parameters [[n, n-;k,4;k]] for 6≤k≤11.

DOI
10.1109/icnisc.2017.00014

Related papers

Entanglement-assisted Quantum Codes of Distance Four Constructed from Caps in PG(5,4) and PG(6,4)

Qiang Fu, Ruihu Li, Genqi Xu +1 more

The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform classical linear quaternary codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entangled qubits between the sender and the receiver.In this work, we give elementary recursive constructions of special quaternary codes of length n and dual distance four that constructed from known caps in projective space PG(5,4) and PG(6,4) for all length 6n283.Consequently, good maximal entanglement EAQECCs of minimum distance four for such length n are constructed from the obtained quaternary codes.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2014•0 citations

Optimal Maximal Entanglement EAQECCs constructed by LCD caps in PG(3,9) and PG(4,9)

Husheng Li, Ruihu Li, Xiuzhen Zhan +1 more

Entanglement-assisted quantum error correcting codes (EAQECCs) play an important role against errors in quantum information system. Especially maximal entanglement EAQECCs can achieve a higher rate and have better noise suppression capabilities. In this paper, LCD caps inPG(3, 9) andPG(4, 9) are discussed and used to construct maximal entanglement EAQECCs with distance 4. According to Hamming bound, most of these results are optimal.

International Conference on Information Science and Education (ICISE-IE)•Dec 1, 2020•0 citations

Linear Plotkin bound for entanglement-assisted quantum codes

Luobin Guo, Ruihu Li

The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using the special structure of linear EAQECCs, we derive an EA-Plotkin bound for linear EAQECCs, which strengthens the previous known EA-Plotkin bound. This linear EA-Plotkin bound is tighter then the EA-Singleton bound, and matches the EA-Hamming bound and the EA-linear programming bound in some cases. We also construct three families of EAQECCs with good parameters. Some of these EAQECCs saturate this linear EA-Plotkin bound and the others are near optimal according to this bound; almost all of these linear EAQECCs are degenerate codes.

Physical Review A•Mar 7, 2013•41 citations

Maximal entanglement entanglement-assisted quantum codes of distance three

Luobin Guo, Qiang Fu, Ruihu Li +1 more

Entanglement-assisted quantum error correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, we give elementary recursive constructions of quaternary zero radical codes with dual distance three for all n ≥ 4. Consequently, good maximal entanglement EAQECCs of minimum distance three for such length n are obtained. Almost all of these EAQECCs are optimal or near optimal according to the EA-quantum Hamming bound.

International Journal of Quantum Information•Feb 1, 2015•6 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

Entanglement assisted quantum error correcting code from Hadamard matrices

Min Liu, Xiaoqing Tan, Daipengwei Bao +1 more

The classical linear codes that construct quantum error correction codes need to meet certain specific conditions. The proposal of entanglement-assisted quantum error correcting codes eliminates the restriction of these conditions, so all classical linear codes can be constructed into entanglement-assisted quantum error correcting codes. The Hadamard matrix is a special type of orthogonal matrix. Hadamard codes, constructed based on the standard form of Hadamard matrices, are a type of linear complementary dual (LCD) codes. By extending the generator and parity-check matrices of Hadamard codes, two types of classical codes whose parameters are [(l+1)(n−1), n−1] and [3n−3, n−1] maintain the LCD property. Utilizing the relationship between their LCD property and the dimensions of the Euclidean hull, this paper constructs two types of EAQECCs based on Hadamard matrices. These EAQECCs can achieve maximal entanglement, resulting in higher code rates and net rates compared to other EAQECCs. Their parameters are [[3n−3, 2n−2, d≥1; n−1]] and [[2n−2, n−1, d≥1; n−1]], respectively.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Sep 19, 2024•0 citations
The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using a decomposition of the 126-cap in PG(5,4), we firstly constructed LCD n-cap with 6The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using a decomposition of the 126-cap in PG(5,4), we firstly constructed LCD n-cap with 6≤n≤120. From these LCD caps, we then derived the related maximal entanglement [[n, n-6,4;6]] EAQECCs. Finally, using LCD LCD subcaps of 126-cap obtained, we constructed maximal entanglement EAQECCs with parameters [[n, n-;k,4;k]] for 6≤k≤11.
The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform classical linear quaternary codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entangled qubits between the sender and the receiver.In this work, we give elementary recursive constructions of special quaternary codes of length n and dual distance four that constructed from known caps in projective space PG(5,4) and PG(6,4) for all length 6n283.Consequently, good maximal entanglement EAQECCs of minimum distance four for such length n are constructed from the obtained quaternary codes.
The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using the special structure of linear EAQECCs, we derive an EA-Plotkin bound for linear EAQECCs, which strengthens the previous known EA-Plotkin bound. This linear EA-Plotkin bound is tighter then the EA-Singleton bound, and matches the EA-Hamming bound and the EA-linear programming bound in some cases. We also construct three families of EAQECCs with good parameters. Some of these EAQECCs saturate this linear EA-Plotkin bound and the others are near optimal according to this bound; almost all of these linear EAQECCs are degenerate codes.
Entanglement-assisted quantum error correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, we give elementary recursive constructions of quaternary zero radical codes with dual distance three for all n ≥ 4. Consequently, good maximal entanglement EAQECCs of minimum distance three for such length n are obtained. Almost all of these EAQECCs are optimal or near optimal according to the EA-quantum Hamming bound.
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.
The classical linear codes that construct quantum error correction codes need to meet certain specific conditions. The proposal of entanglement-assisted quantum error correcting codes eliminates the restriction of these conditions, so all classical linear codes can be constructed into entanglement-assisted quantum error correcting codes. The Hadamard matrix is a special type of orthogonal matrix. Hadamard codes, constructed based on the standard form of Hadamard matrices, are a type of linear complementary dual (LCD) codes. By extending the generator and parity-check matrices of Hadamard codes, two types of classical codes whose parameters are [(l+1)(n−1), n−1] and [3n−3, n−1] maintain the LCD property. Utilizing the relationship between their LCD property and the dimensions of the Euclidean hull, this paper constructs two types of EAQECCs based on Hadamard matrices. These EAQECCs can achieve maximal entanglement, resulting in higher code rates and net rates compared to other EAQECCs. Their parameters are [[3n−3, 2n−2, d≥1; n−1]] and [[2n−2, n−1, d≥1; n−1]], respectively.