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

From MaRDI portal
Publication:670071

DOI10.1007/S11128-019-2234-5zbMATH Open1417.81108arXiv1812.05312OpenAlexW3098999158WikidataQ62581718 ScholiaQ62581718MaRDI QIDQ670071FDOQ670071


Authors: Fernando Hernando, Ryutaroh Matsumoto, Diego Ruano, Carlos Galindo Edit this on Wikidata


Publication date: 15 March 2019

Published in: Quantum Information Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1812.05312




Recommendations




Cites Work


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)