Entanglement-assisted quantum error-correcting codes over arbitrary finite fields
Information Theory
2021-01-29 v4 math.IT
Quantum Physics
Abstract
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.
Cite
@article{arxiv.1812.05312,
title = {Entanglement-assisted quantum error-correcting codes over arbitrary finite fields},
author = {Carlos Galindo and Fernando Hernando and Ryutaroh Matsumoto and Diego Ruano},
journal= {arXiv preprint arXiv:1812.05312},
year = {2021}
}