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.
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.
Hermitian linear complementary dual (LCD) codes are a class of linear codes that intersect with their Hermitian dual trivially. Each Hermitian LCD code can give an entanglement-assisted quantum error-correcting code (EAQECC) with maximal entanglement. Methods of constructing Hermitian LCD codes from known codes were developed, and seven new Hermitian LCD codes with parameters $ [119,4,88]_{4} $, $ [123,4,91]_{4} $, $ [124,4,92]_{4} $, $ [136,4,101]_{4} $, $ [140,4,104]_{4} $, $ [188,4,140]_{4} $ and $ [212,4,158]_{4} $ were constructed. Seven families of Hermitian LCD codes and their related EAQECCs were derived from these codes. These new EAQECCs have better parameters than those known in the literature.
Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of −1+xm - 1 + x m , which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD–QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD–QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.
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.
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs, which can only be constructed from dual-containing codes. Operator quantum error-correcting codes allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement-assisted quantum error-correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement- assisted quantum error correction formalism. This new scheme, which we call entanglement-assisted operator quantum error correction (EAOQEC), is the most general and powerful quantum error-correcting technique known, retaining the advantages of both entanglement-assistance and passive correction. We present the formalism, show the considerable freedom in constructing EAOQECCs from classical codes, and demonstrate the construction with examples.
Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.