<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-28T19:17:38Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/40134" metadataPrefix="qdc">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/40134</identifier><datestamp>2021-06-24T07:41:10Z</datestamp><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>com_10324_894</setSpec><setSpec>com_10324_1129</setSpec><setSpec>com_10324_931</setSpec><setSpec>col_10324_32199</setSpec><setSpec>col_10324_1193</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>Entanglement-assisted quantum error-correcting codes over arbitrary finite fields</dc:title>
<dc:creator>Galindo, Carlos</dc:creator>
<dc:creator>Hernando, Fernando</dc:creator>
<dc:creator>Matsumoto, Ryutaroh</dc:creator>
<dc:creator>Ruano Benito, Diego</dc:creator>
<dcterms: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.</dcterms:abstract>
<dcterms:dateAccepted>2020-01-13T15:16:33Z</dcterms:dateAccepted>
<dcterms:available>2020-01-13T15:16:33Z</dcterms:available>
<dcterms:created>2020-01-13T15:16:33Z</dcterms:created>
<dcterms:issued>2019</dcterms:issued>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Quantum Information Processing, 2019, vol. 18, n. 116</dc:identifier>
<dc:identifier>1570-0755</dc:identifier>
<dc:identifier>http://uvadoc.uva.es/handle/10324/40134</dc:identifier>
<dc:identifier>10.1007/s11128-019-2234-5</dc:identifier>
<dc:identifier>Quantum Information Processing</dc:identifier>
<dc:identifier>18:116</dc:identifier>
<dc:identifier>1573-1332</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://link.springer.com/article/10.1007/s11128-019-2234-5</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</dc:rights>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>