Add to ORKGWe show that it is NP-hard to approximate, to within an additive constant, the maximum success probability of players sharing quantum entanglement in a two-player game with classical questions of logarithmic length and classical answers of constant length. As a corollary, the inclusion NEXP subseteq MIP^*, first shown by Ito and Vidick (FOCS'12) with three provers, holds with two provers only. The proof is based on a simpler, improved analysis of the low-degree test of Raz and Safra (STOC'97) against two entangled provers
Entanglement is at the heart of quantum mechanics. The nonlocal correlations that can be obtained fr...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...
We show that for any Є > 0 the problem of finding a factor (2 - Є) approximation to the entangled va...
We show that for any ε > 0 the problem of finding a factor (2 - ε) approximation to the entangled va...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We show that for any Є > 0 the problem of finding a factor (2 - Є) approximation to the entangled va...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We show that the value of a general two-prover quantum game cannot be computed by a semidefinite pro...
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite pr...
We show that the value of a general two-prover quantum game cannot be computed by a semidefinite pro...
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. O...
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. O...
Entanglement is at the heart of quantum mechanics. The nonlocal correlations that can be obtained fr...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...
We show that for any Є > 0 the problem of finding a factor (2 - Є) approximation to the entangled va...
We show that for any ε > 0 the problem of finding a factor (2 - ε) approximation to the entangled va...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We show that for any Є > 0 the problem of finding a factor (2 - Є) approximation to the entangled va...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We establish the first hardness results for the problem of computing the value of one-round games pl...
We show that the value of a general two-prover quantum game cannot be computed by a semidefinite pro...
We show that the value of a general two-prover quantum game cannot be computed by a semi-definite pr...
We show that the value of a general two-prover quantum game cannot be computed by a semidefinite pro...
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. O...
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. O...
Entanglement is at the heart of quantum mechanics. The nonlocal correlations that can be obtained fr...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of...