Two-Player Entangled Games are NP-Hard

@inproceedings{Natarajan2018TwoPlayerEG,
  title={Two-Player Entangled Games are NP-Hard},
  author={Anand Natarajan and Thomas Vidick},
  booktitle={CCC},
  year={2018}
}
We show that it is NP-hard to approximate, to within an additive constant, 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. As a corollary, the inclusion NEXP ⊆ MIP∗, first shown by Ito and Vidick (FOCS’12) with three provers, holds with two provers only. The proof is based on a simpler, improved analysis of the low-degree test of Raz and Safra (STOC’97) against… CONTINUE READING

Similar Papers

Loading similar papers…