Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

From MaRDI portal
Publication:670071




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.




Cited in
(55)






This page was built for publication: Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670071)