Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SIAM Review
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
SIAM Journal on Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Convex Optimization
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Computational Complexity
How to Play Unique Games Using Embeddings
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Entangled Games are Hard to Approximate
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A Counterexample to Strong Parallel Repetition
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Rounding Parallel Repetitions of Unique Games
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Conditional Hardness for Approximate Coloring
SIAM Journal on Computing
No Strong Parallel Repetition with Entangled and Non-signaling Provers
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Bell inequalities and entanglement
Quantum Information & Computation
Product rules in semidefinite programming
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
QMA variants with polynomially many provers
Quantum Information & Computation
| Hi-index | 0.00 |
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.