Two-player entangled games are NP-hard
Quantum Physics
2020-11-24 v2 Computational Complexity
Abstract
We show that the maximum success probability of players sharing quantum entanglement in a two-player game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant factors. As a corollary, the inclusion , first shown in [IV12] with three provers, holds with two provers only. The proof is based on a simpler, improved analysis of the low-degree test Raz and Safra (STOC'97) against two entangled provers.
Keywords
Cite
@article{arxiv.1710.03062,
title = {Two-player entangled games are NP-hard},
author = {Anand Natarajan and Thomas Vidick},
journal= {arXiv preprint arXiv:1710.03062},
year = {2020}
}
Comments
The paper has been withdrawn due to an error in the proof of the main theorem, inherited from arXiv:1302.1242. For more details see http://users.cms.caltech.edu/~vidick/errata.pdf and arXiv:2009.12982