paper

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

arXiv:1812.05312 · doi:10.1007/s11128-019-2234-5

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.

References in corpus (4)

Cited by in corpus (19)