Unique games with entangled provers are easy

Julia Kempe, Oded Regev, Ben Toner

Research output: Contribution to journalArticle

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 (SDP). 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 into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.

Original languageEnglish (US)
Pages (from-to)3207-3229
Number of pages23
JournalSIAM Journal on Computing
Volume39
Issue number7
DOIs
StatePublished - 2010

Fingerprint

Semidefinite Program
Game
Entanglement
Rounding
Thing
Permutation
Transform
Binary
Imply
Approximation
Theorem

Keywords

  • Parallel repetition
  • Quantum entanglement
  • Semidefinite programming
  • Two-prover one-round games

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science(all)

Cite this

Unique games with entangled provers are easy. / Kempe, Julia; Regev, Oded; Toner, Ben.

In: SIAM Journal on Computing, Vol. 39, No. 7, 2010, p. 3207-3229.

Research output: Contribution to journalArticle

Kempe, Julia ; Regev, Oded ; Toner, Ben. / Unique games with entangled provers are easy. In: SIAM Journal on Computing. 2010 ; Vol. 39, No. 7. pp. 3207-3229.
@article{ffe16d32d2514868b87a3ac90123d362,
title = "Unique games with entangled provers are easy",
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 (SDP). 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 into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.",
keywords = "Parallel repetition, Quantum entanglement, Semidefinite programming, Two-prover one-round games",
author = "Julia Kempe and Oded Regev and Ben Toner",
year = "2010",
doi = "10.1137/090772885",
language = "English (US)",
volume = "39",
pages = "3207--3229",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "7",

}

TY - JOUR

T1 - Unique games with entangled provers are easy

AU - Kempe, Julia

AU - Regev, Oded

AU - Toner, Ben

PY - 2010

Y1 - 2010

N2 - 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 (SDP). 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 into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.

AB - 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 (SDP). 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 into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.

KW - Parallel repetition

KW - Quantum entanglement

KW - Semidefinite programming

KW - Two-prover one-round games

UR - http://www.scopus.com/inward/record.url?scp=77956052906&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956052906&partnerID=8YFLogxK

U2 - 10.1137/090772885

DO - 10.1137/090772885

M3 - Article

AN - SCOPUS:77956052906

VL - 39

SP - 3207

EP - 3229

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 7

ER -