TY  - JOUR
AU  - Cooney, T.
AU  - Junge, M.
AU  - Palazuelos Cabezón, Carlos
AU  - Pérez García, David
PY  - 2015
DO  - http://dx,doi.org/10.1007/s00037-014-0096-x
SN  - 1420-8954
UR  - https://hdl.handle.net/20.500.14352/34620
T2  - Computational complexit
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...
LA  - eng
M2  - 133
PB  - Springer Basel
KW  - Quantum games
KW  - Efficient approximation
KW  - Parallelrepetition
KW  - Operator spaces
TI  - Rank-one quantum games
TY  - journal article
VL  - 24
ER  -