Entangled games are hard to approximate

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto +2

We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In…