Unique Games with Entangled Provers are Easy

Details Unique Games with Entangled Provers are Easy Unique Games with Entangled Provers are Easy

2007-10-02

arxiv.org/abs/0710.0655v3

Physics

Quantum Physics

25 pages, revised version, contains parallel repetition result

Scientific paper

We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program. Essentially the only algorithm known previously was for the special case of binary answers, as follows from the work of Tsirelson in 1980. Among other things, our result implies that the variant of the unique games conjecture where we allow the provers to share entanglement is false. Our proof is based on a novel `quantum rounding technique', showing how to take a solution to an SDP and transform it to a strategy for entangled provers. Using our approximation by a semidefinite program we also show a parallel repetition theorem for unique entangled games.

Affiliated with

Also associated with

No associations

Rating

Unique Games with Entangled Provers are Easy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unique Games with Entangled Provers are Easy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unique Games with Entangled Provers are Easy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-285138