Jump to Content
View Cart
Logged Out Log In
SIAM J. Comput. 39, pp. 3207-3229 (23 pages)
Unique Games with Entangled Provers Are Easy
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookWe 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.
© 2010 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received October 05, 2009
Accepted May 05, 2010
Published online July 15, 2010
Accepted May 05, 2010
Published online July 15, 2010
Permalink
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar