Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate

Research output: Contribution to journalComment/debatepeer-review

Abstract

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 soundness analysis not being carried out correctly, the analysis fails to prove the claimed result. The error invalidates the proofs of the main computational hardness results claimed in the paper. We discuss implications for subsequent works. In some cases results can be partially recovered by applying a weakened version of Theorem 3.1 shown in [Z. Ji et al., Quantum Soundness of the Classical Low Individual Degree Test, arXiv:2009.1298, 2020] subsequently to the discovery of the error. The validity of Theorem 3.1 as stated in the paper remains an open question.
Original languageEnglish
Pages (from-to)1423-1427
Number of pages5
JournalSIAM Journal on Computing
Volume49
Issue number6
DOIs
StatePublished - 18 Dec 2020
Externally publishedYes

Fingerprint

Dive into the research topics of 'Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate'. Together they form a unique fingerprint.

Cite this