Mostrar el registro sencillo del ítem

dc.contributor.authorGalindo, Carlos
dc.contributor.authorHernando, Fernando
dc.contributor.authorMatsumoto, Ryutaroh
dc.contributor.authorRuano Benito, Diego 
dc.date.accessioned2020-01-13T15:16:33Z
dc.date.available2020-01-13T15:16:33Z
dc.date.issued2019
dc.identifier.citationQuantum Information Processing, 2019, vol. 18, n. 116es
dc.identifier.issn1570-0755es
dc.identifier.urihttp://uvadoc.uva.es/handle/10324/40134
dc.description.abstractWe 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.es
dc.format.mimetypeapplication/pdfes
dc.language.isoenges
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleEntanglement-assisted quantum error-correcting codes over arbitrary finite fieldses
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doi10.1007/s11128-019-2234-5es
dc.relation.publisherversionhttps://link.springer.com/article/10.1007/s11128-019-2234-5es
dc.identifier.publicationtitleQuantum Information Processinges
dc.identifier.publicationvolume18:116es
dc.peerreviewedSIes
dc.description.projectSupported by the Spanish Ministry of Economy/FEDER: grants MTM2015-65764-C3-1-P, MTM2015-65764-C3-2-P, MTM2015-69138-REDT and RYC-2016-20208 (AEI/FSE/UE), the University Jaume I: grant UJI-B2018-10, Spanish Junta de CyL: grant VA166G18, and JSPS Grant No. 17K06419.es
dc.identifier.essn1573-1332es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.type.hasVersioninfo:eu-repo/semantics/draftes


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem