<?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-08-20T15:39:56Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/73042" metadataPrefix="oai_dc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/73042</identifier><datestamp>2023-08-27T05:05:13Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>On the power of quantum entanglement in multipartite quantum XOR games</dc:title>
   <dc:creator>Junge, Marius</dc:creator>
   <dc:creator>Palazuelos Cabezón, Carlos</dc:creator>
   <dc:subject>519.83:530.145</dc:subject>
   <dc:subject>Nonlocal games</dc:subject>
   <dc:subject>Quantum XOR games</dc:subject>
   <dc:subject>Operator spaces</dc:subject>
   <dc:subject>Teoría de los quanta</dc:subject>
   <dc:subject>Análisis funcional y teoría de operadores</dc:subject>
   <dc:subject>Investigación operativa (Matemáticas)</dc:subject>
   <dc:subject>2210.23 Teoría Cuántica</dc:subject>
   <dc:subject>1207 Investigación Operativa</dc:subject>
   <dc:description>In this paper we show that, given k≥3, there exist k-player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.</dc:description>
   <dc:description>Ministerio de Ciencia e Innovación (MICINN)</dc:description>
   <dc:description>Comunidad de Madrid</dc:description>
   <dc:description>National Science Foundation</dc:description>
   <dc:description>Depto. de Análisis Matemático y Matemática Aplicada</dc:description>
   <dc:description>Fac. de Ciencias Matemáticas</dc:description>
   <dc:description>FALSE</dc:description>
   <dc:description>unpub</dc:description>
   <dc:date>2023-06-22T12:41:02Z</dc:date>
   <dc:date>2023-06-22T12:41:02Z</dc:date>
   <dc:date>2023-02-23</dc:date>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/73042</dc:identifier>
   <dc:identifier>XXXX-XXXX</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>PID2020-113523GB-I00; CEX2019-000904-S</dc:relation>
   <dc:relation>QUITEMAD-CM P2018/TCS4342</dc:relation>
   <dc:relation>DMS 1800872; Raise-TAG183917</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>