Cooney, T.Junge, M.Palazuelos Cabezón, CarlosPérez García, David2023-06-192023-06-1920151420-8954http://dx,doi.org/10.1007/s00037-014-0096-xhttps://hdl.handle.net/20.500.14352/34620In 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 ω qow . In particular, we show that ω qow can be computed efficiently and it satisfies a perfect parallel repetition theorem.engjournal articlehttp://link.springer.com/article/10.1007/s00037-014-0096-xhttp://link.springer.comhttp://arxiv.org/abs/1112.3563restricted access517.98Quantum gamesEfficient approximationParallel repetitionOperator spacesAnálisis funcional y teoría de operadores