Feb 6, 2013 · We show that for any eps>0 the problem of finding a factor (2-eps) approximation to the entangled value of a three-player XOR game is NP-hard.
Abstract. We show that for any ε > 0 the problem of finding a factor ( 2 − ε ) approximation to the entangled value of a three-player XOR game is NP-hard.
This note indicates an error in the proof of Theorem 3.1 in [T. Vidick, SIAM J. Comput., 45 (2016), pp. 1007--1063]. Due to an induction step in the ...
Notice of Retraction: Three-Player Entangled XOR Games Are NP-Hard to Approximate. Abstract: Retracted. Note: ...
In this note we describe the error (Section 1), explain how it affects the results claimed in [Vid16] and how they can be partially recovered using [JNV+20b] ( ...
These results are the first constant-factor hardness of approximation results for entangled games or quantum violations of Bell inequalities shown under the ...
Feb 5, 2013 · These results are the first constant-factor hardness of approximation results for entangled games or quantum violations of Bell inequalities ...
Oct 22, 2024 · We show that for any eps>0 the problem of finding a factor (2-eps) approximation to the entangled value of a three-player XOR game is NP-hard.
Three-Player Entangled XOR Games Are NP-Hard to Approximate
www.semanticscholar.org › paper › Thre...
The key technical component of this work is a soundness analysis of a point-vs-plane low-degree test against entangled players that extends and simplifies ...
Abstract. We show that for any eps>0 the problem of finding a factor (2-eps) approximation to the entangled value of a three-player XOR game is NP-hard.