Unique Games with Entangled Provers are Easy

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.

[1]  Ran Raz,et al.  A Counterexample to Strong Parallel Repetition , 2008, FOCS.

[2]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[3]  Michael M. Wolf,et al.  Bell inequalities and entanglement , 2001, Quantum Inf. Comput..

[4]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[5]  S. Massar,et al.  Causality and Tsirelson's bounds , 2004, quant-ph/0409066.

[6]  L. Masanes.  Extremal quantum correlations for N parties with two dichotomic observables per site , 2005, quant-ph/0512100.

[7]  Konstantin Makarychev,et al.  How to Play Unique Games Using Embeddings , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[8]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[9]  Anupam Gupta,et al.  Approximating unique games , 2006, SODA '06.

[10]  Julia Kempe,et al.  No Strong Parallel Repetition with Entangled and Non-signaling Provers , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[11]  Konstantin Makarychev,et al.  How to Play Unique Games on Expanders , 2010, WAOA.

[12]  A. Shimony,et al.  Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .

[13]  A. Acín,et al.  Bounding the set of quantum correlations. , 2006, Physical review letters.

[14]  William Slofstra,et al.  Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[17]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[18]  Julia Kempe,et al.  The Unique Games Conjecture with Entangled Provers is False , 2007, Algebraic Methods in Computational Complexity.

[19]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[20]  Mario Szegedy,et al.  Product Rules in Semidefinite Programming , 2007, FCT.

[21]  David Steurer,et al.  Rounding Parallel Repetitions of Unique Games , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[23]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[24]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[25]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[26]  Anup Rao,et al.  Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..

[27]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[28]  Albert Einstein,et al.  Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? , 1935 .

[29]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[30]  Nisheeth K. Vishnoi,et al.  Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC.

[31]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[32]  M. Wolf,et al.  Unbounded Violation of Tripartite Bell Inequalities , 2007, quant-ph/0702189.

[33]  Moses Charikar,et al.  Near-optimal algorithms for unique games , 2006, STOC '06.

[34]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[35]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.

[36]  J. Bell.  On the Einstein-Podolsky-Rosen paradox , 1964 .

[37]  Thomas Holenstein,et al.  Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.

[38]  Luca Trevisan,et al.  Approximation algorithms for unique games , 2005, IEEE Annual Symposium on Foundations of Computer Science.

[39]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[40]  Thomas Holenstein.  Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..

[41]  Tsuyoshi Ito,et al.  Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies , 2008, 2009 24th Annual IEEE Conference on Computational Complexity.

[42]  B. S. Cirel'son.  Quantum generalizations of Bell's inequality , 1980 .

[43]  Elchanan Mossel,et al.  Conditional Hardness for Approximate Coloring , 2009, SIAM J. Comput..

[44]  R. Cleve,et al.  Consequences and limits of nonlocal strategies , 2004 .

[45]  Keiji Matsumoto,et al.  Entangled Games are Hard to Approximate , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.