{"paper":{"title":"A parallel repetition theorem for entangled two-player one-round games under product distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Attila Pereszl\\'enyi, Penghui Yao, Rahul Jain","submitted_at":"2013-11-25T14:07:52Z","abstract_excerpt":"We show a parallel repetition theorem for the entangled value $\\omega^*(G)$ of any two-player one-round game $G$ where the questions $(x,y) \\in \\mathcal{X}\\times\\mathcal{Y}$ to Alice and Bob are drawn from a product distribution on $\\mathcal{X}\\times\\mathcal{Y}$. We show that for the $k$-fold product $G^k$ of the game $G$ (which represents the game $G$ played in parallel $k$ times independently),\n  $ \\omega^*(G^k) =\\left(1-(1-\\omega^*(G))^3\\right)^{\\Omega\\left(\\frac{k}{\\log(|\\mathcal{A}| \\cdot |\\mathcal{B}|)}\\right)} $, where $\\mathcal{A}$ and $\\mathcal{B}$ represent the sets from which the an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6309","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}