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

arXiv:2207.05647 · Quantum Information Processing

Constructing quantum error-correcting codes that require a variable amount of entanglement

Gaojun Luo, Martianus Frederic Ezerman, Markus Grassl, San Ling

Published Dec 26, 2023• 53 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04211-x

Related papers

Entanglement-Assisted Quantum Error-Correcting Codes

Igor Devetak, Todd A. Brun, Min-Hsiu Hsieh

New Trends in Mathematical Physics•Jan 1, 2009•22 citations

High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement

Min-Hsiu Hsieh, Wen-Tai Yen, Li-Yi Hsu

Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally entangled states in constructing EAQECCs is a practical obstacle to its use. It is also conjectured that the power of entanglement-assisted formalism to convert those good classical codes comes from massive consumption of maximally entangled states. We show that the above conjecture is wrong by providing families of EAQECCs with an entanglement consumption rate that diminishes linearly as a function of the code length. Notably, two families of EAQECCs constructed in the paper require only one copy of maximally entangled state no matter how large the code length is. These families of EAQECCs that are constructed from classical finite geometric LDPC codes perform very well according to our numerical simulations. Our work indicates that EAQECCs are not only theoretically interesting, but also physically implementable. Finally, these high performance entanglement-assisted LDPC codes with low entanglement consumption rates allow one to construct high-performance standard QECCs with very similar parameters.

arXiv:0906.5532•IEEE Transactions on Information Theory•Feb 18, 2011•73 citations

Entanglement-assisted quantum error-correcting codes

Todd A. Brun, Min-Hsiu Hsieh

Cambridge University Press eBooks•Sep 5, 2013•3 citations

Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals

Hajime Matsui, Kakeru Kaneko

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+x^m$$ - 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.

Designs Codes and Cryptography•May 31, 2025•2 citations

Entanglement-assisted quantum error-correcting codes from units

Ted Hurley, Donny Hurley, Barry Hurley

Entanglement-assisted quantum error-correcting codes (EAQECCs) to desired rate, error-correcting capability and maximum shared entanglement are constructed. Thus for a required rate $R$, required error-correcting capability to correct $t$ errors, mds (maximum distance separable) EAQECCs of the form $[[n,r,d;c]]$ with $R=\frac{r}{n}, d\geq (2t+1), c = (n-r), d= (n-r+1)$ are constructed. Series of such codes may be constructed where the rate and the relative distance approach non-zero constants as $n$ approaches infinity. The codes may also be constructed over prime order fields in which modular arithmetic may be employed.

arXiv:1806.10875•Jun 28, 2018•12 citations

Constructions of good entanglement-assisted quantum error correcting codes

Kenza Guenda, Somphong Jitman, Thomas Aaron Gulliver

arXiv:1606.00134•Designs Codes and Cryptography•Jan 25, 2017•263 citations
Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally entangled states in constructing EAQECCs is a practical obstacle to its use. It is also conjectured that the power of entanglement-assisted formalism to convert those good classical codes comes from massive consumption of maximally entangled states. We show that the above conjecture is wrong by providing families of EAQECCs with an entanglement consumption rate that diminishes linearly as a function of the code length. Notably, two families of EAQECCs constructed in the paper require only one copy of maximally entangled state no matter how large the code length is. These families of EAQECCs that are constructed from classical finite geometric LDPC codes perform very well according to our numerical simulations. Our work indicates that EAQECCs are not only theoretically interesting, but also physically implementable. Finally, these high performance entanglement-assisted LDPC codes with low entanglement consumption rates allow one to construct high-performance standard QECCs with very similar parameters.
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−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.
Entanglement-assisted quantum error-correcting codes (EAQECCs) to desired rate, error-correcting capability and maximum shared entanglement are constructed. Thus for a required rate RRR, required error-correcting capability to correct ttt errors, mds (maximum distance separable) EAQECCs of the form [[n,r,d;c]][[n,r,d;c]][[n,r,d;c]] with R=rn,d≥(2t+1),c=(n−r),d=(n−r+1)R=\frac{r}{n}, d\geq (2t+1), c = (n-r), d= (n-r+1)R=nr​,d≥(2t+1),c=(n−r),d=(n−r+1) are constructed. Series of such codes may be constructed where the rate and the relative distance approach non-zero constants as nnn approaches infinity. The codes may also be constructed over prime order fields in which modular arithmetic may be employed.