RT Journal Article
T1 Rank-one quantum games
A1 Cooney, T.
A1 Junge, M.
A1 Palazuelos Cabezón, Carlos
A1 Pérez García, David
AB 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 ω qow . In particular, we show that ω qow can be computed efficiently and it satisfies a perfect parallel repetition theorem.
PB Springer Basel
SN 1420-8954
YR 2015
FD 2015
LK https://hdl.handle.net/20.500.14352/34620
UL https://hdl.handle.net/20.500.14352/34620
LA eng
NO Unión Europea. FP7
NO Comunidad de Madrid
NO NSF
NO "Juan de la Cierva" program (Spain)
DS Docta Complutense
RD 13 abr 2025