License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-13048
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1304/
Go to the corresponding Portal


Kempe, Julia ; Regev, Oded ; Toner, Ben

The Unique Games Conjecture with Entangled Provers is False

pdf-format:
Document 1.pdf (521 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{kempe_et_al:DSP:2008:1304,
  author =	{Julia Kempe and Oded Regev and Ben Toner},
  title =	{The Unique Games Conjecture with Entangled Provers is False},
  booktitle =	{Algebraic Methods in Computational Complexity},
  year =	{2008},
  editor =	{Manindra Agrawal and Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  number =	{07411},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1304},
  annote =	{Keywords: Unique games, entanglement}
}

Keywords: Unique games, entanglement
Seminar: 07411 - Algebraic Methods in Computational Complexity
Issue Date: 2008
Date of publication: 15.01.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI