Thomas Vidick. Three-Player Entangled XOR Games Are NP-Hard to Approximate. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA. pages 766-775, IEEE Computer Society, 2013. [doi]
Abstract is missing.