<?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-14T17:11:20Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/78747" metadataPrefix="uketd_dc">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/78747</identifier><datestamp>2025-10-16T19:04:51Z</datestamp><setSpec>com_10324_38</setSpec><setSpec>col_10324_852</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
<dc:title>Poder estadístico de las desigualdades de Bell</dc:title>
<dc:creator>Giraldo García, Daniel</dc:creator>
<uketdterms:advisor>Araújo Santos, Mateus de</uketdterms:advisor>
<uketdterms:advisor>Nieto Calzada, Luis Miguel</uketdterms:advisor>
<dcterms:abstract>En este trabajo se buscarán los juegos locales con mayor poder estadístico, identificando aquellos con&#xd;
mayor entropía relativa. Para ello, se desarrollará un programa que generará todos los juegos posibles en&#xd;
cada escenario y evaluará sus cotas clásica y cuántica. Además, se buscarán los estados y POVMs que&#xd;
optimicen la cota cuántica en los mejores juegos.</dcterms:abstract>
<dcterms:abstract>In this work, local games with the highest statistical power will be identified by focusing on those with&#xd;
the highest relative entropy. To achieve this, a program will be developed to generate all possible games&#xd;
for each scenario and evaluate their classical and quantum bounds. Additionally, for the best games, the&#xd;
states and POVMs that optimize the quantum bound will be sought.</dcterms:abstract>
<dcterms:issued>2024</dcterms:issued>
<dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
<dc:language xsi:type="dcterms:ISO639-2">spa</dc:language>
<uketdterms:sponsor>Departamento de Física Teórica, Atómica y Óptica</uketdterms:sponsor>
<dcterms:isReferencedBy>https://uvadoc.uva.es/handle/10324/78747</dcterms:isReferencedBy>
<dcterms:license>https://uvadoc.uva.es/bitstream/10324/78747/3/license.txt</dcterms:license>
<uketdterms:checksum xsi:type="uketdterms:MD5">289d98c1665ee0d20312360f0e8643c8</uketdterms:checksum>
<dc:identifier xsi:type="dcterms:URI">https://uvadoc.uva.es/bitstream/10324/78747/1/TFG-G7580.pdf</dc:identifier>
<uketdterms:checksum xsi:type="uketdterms:MD5">b1206efb4f8a066adf3aad3a1b2fa755</uketdterms:checksum>
<dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 Internacional</dc:rights>
</uketd_dc:uketddc></metadata></record></GetRecord></OAI-PMH>