Photo by rahuulmiishra from unsplash
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… Click to show full 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.
Keywords:
assisted quantum;
codes arbitrary;
correcting codes;
error correcting;
quantum error;
entanglement assisted
Journal Title: Quantum Information Processing
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Quantum Information Processing
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!