Rank-one Quantum Games

Understand

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.