<?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-18T00:11:16Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/169118" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/169118</identifier><datestamp>2025-07-23T07:02:42Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452951</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" 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>The communication cost of simulating POVMs over maximally entangled qubits</dc:title>
   <dc:creator>Ravell Rodríguez, Ricard</dc:creator>
   <dc:subject>Àrees temàtiques de la UPC::Enginyeria de la telecomunicació</dc:subject>
   <dc:subject>Detectors</dc:subject>
   <dc:subject>Quantum theory</dc:subject>
   <dc:subject>Bell theorem</dc:subject>
   <dc:subject>quantum nonlocality</dc:subject>
   <dc:subject>communication complexity</dc:subject>
   <dc:subject>detection loophole.</dc:subject>
   <dc:subject>Detectors</dc:subject>
   <dc:subject>Quàntums, Teoria dels</dc:subject>
   <dcterms:abstract>In [Toner and Bacon, Phys. Rev. Lett. 91, 187904 (2003)], $1$ bit of communication was proven to be enough to simulate the statistics of local projective measurements over the maximally entangled state. Ever since then, the question of whether $1$ bit is also enough for the case of generalized measurements has been open. In this thesis, we retort to inefficiency-resistant Bell functionals, a powerful technique to prove lower bounds communication complexity, to numerically study this question. The results obtained suggest that, indeed, as is the case with projective measurements, $1$ bit of communication suffices to simulate POVMs over maximally entangled qubits.</dcterms:abstract>
   <dcterms:issued>2019-09-09</dcterms:issued>
   <dc:type>Master thesis</dc:type>
   <dc:rights>S'autoritza la difusió de l'obra mitjançant la llicència Creative Commons o similar 'Reconeixement-NoComercial- SenseObraDerivada'</dc:rights>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:publisher>Universitat Politècnica de Catalunya</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>