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
Some optimal inapproximability results
Journal of the ACM (JACM)
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Entangled Games are Hard to Approximate
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Unique Games with Entangled Provers are Easy
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
Proceedings of the forty-second ACM symposium on Theory of computing
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's
Quantum Information & Computation
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
A two-player one-round binary game consists of two cooperative players who each repliesby one bit to a message that he receives privately; they win the game if both questions andanswers satisfy some predetermined property. A game is called entangled if the playersare allowed to share a priori entanglement. It is well-known that the maximum winningprobability (value) of entangled XOR-games (binary games in which the predeterminedproperty depends only on the XOR of the two output bits) can be computed by asemidefinite program. In this paper we extend this result in the following sense; if abinary game is uniform, meaning that in an optimal strategy the marginal distributionsof the output of each player are uniform, then its entangled value can be efficientlycomputed by a semidefinite program. We also introduce a lower bound on the entangledvalue of a general two-player one-round game; this bound depends on the size of theoutput set of each player and can be computed by a semidefinite program. In particular,we show that if the game is binary, ωq is its entangled value, and ωsdp is the optimumvalue of the corresponding semidefinite program, then 0.68 ωsdp q ≤ ωsdp.