Rank-one Quantum Games
arXiv:1112.3563
Abstract
In this work we study rank-one quantum games. In particular, we focus on the study of the computability of the entangled value . We show that the value can be efficiently approximated up to a multiplicative factor of 4. We also study the behavior of 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 value of rank-one games with one-way communication . In particular, we show that can be computed efficiently and it satisfies a perfect parallel repetition theorem.
arXiv commentv2: Paper re-written: Abstrac modified, more detailed explanations of results and proofs. New example in Section 7.1.3
References in corpus (12)
- Noncommutative vector valued -spaces and completely -summing maps
- Connes' embedding problem and Tsirelson's problem
- Large violation of Bell inequalities with low entanglement
- Unbounded violation of tripartite Bell inequalities
- Operator Space theory: a natural framework for Bell inequalities
- Grothendieck's Theorem for Operator Spaces
- Embedding of OH and logarithmic `little Grothendieck inequality'
- Coherent state exchange in multi-prover quantum interactive proof systems
- Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
- Representation of certain homogeneous Hilbertian operator spaces and applications
- Quantum Strategies and Local Operations
- Quantum Multi Prover Interactive Proofs with Communicating Provers