TY - JOUR
T1 - Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
AU - Galindo, Carlos
AU - Hernando, Fernando
AU - Yamashita, Ryutaro
AU - Ruano, Diego
PY - 2019
Y1 - 2019
N2 - We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.
AB - We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as well. We also give a Gilbert–Varshamov bound for EAQECCs and constructions of EAQECCs coming from punctured self-orthogonal linear codes which are valid for any finite field.
KW - Entanglement-assisted quantum error-correcting codes
KW - Gilbert–Varshamov bound
KW - Symplectic, Hermitian and Euclidean duality
UR - http://www.scopus.com/inward/record.url?scp=85062616578&partnerID=8YFLogxK
U2 - 10.1007/s11128-019-2234-5
DO - 10.1007/s11128-019-2234-5
M3 - Journal article
SN - 1570-0755
VL - 18
JO - Quantum Information Processing
JF - Quantum Information Processing
IS - 4
M1 - 116
ER -