<?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-14T21:09:01Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/78747" metadataPrefix="qdc">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><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>Poder estadístico de las desigualdades de Bell</dc:title>
<dc:creator>Giraldo García, Daniel</dc:creator>
<dc:contributor>Araújo Santos, Mateus de</dc:contributor>
<dc:contributor>Nieto Calzada, Luis Miguel</dc:contributor>
<dc:contributor>Universidad de Valladolid. Facultad de Ciencias</dc:contributor>
<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:dateAccepted>2025-10-16T15:14:19Z</dcterms:dateAccepted>
<dcterms:available>2025-10-16T15:14:19Z</dcterms:available>
<dcterms:created>2025-10-16T15:14:19Z</dcterms:created>
<dcterms:issued>2024</dcterms:issued>
<dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
<dc:identifier>https://uvadoc.uva.es/handle/10324/78747</dc:identifier>
<dc:language>spa</dc:language>
<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>