{"paper":{"title":"Rank-one Quantum Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. Palazuelos, D. P\\'erez-Garc\\'ia, M. Junge, T. Cooney","submitted_at":"2011-12-15T16:40:37Z","abstract_excerpt":"In this work we study rank-one quantum games. In particular, we focus on the study of the computability of the entangled value $\\omega^*$. We show that the value $\\omega^*$ can be efficiently approximated up to a multiplicative factor of 4. We also study the behavior of $\\omega^*$ under the parallel repetition of rank-one quantum games, showing that it does not verify a perfect parallel repetition theorem. To obtain these results, we first connect rank-one games with the mathematical theory of operator spaces. We also reprove with these new tools essentially known results about the entangled v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3563","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"}