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

DOI10.1137/20M1368598zbMath1470.81023MaRDI QIDQ3387765

Thomas Vidick

Publication date: 13 January 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

interactive proofsquantum complexitynonlocal games

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) (n)-person games, (n>2) (91A06) Quantum measurement theory, state operations, state preparations (81P15) Approximation algorithms (68W25) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• Unnamed Item
• Unnamed Item
• Non-deterministic exponential time has two-prover interactive protocols
• Three-Player Entangled XOR Games are NP-Hard to Approximate
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)

This page was built for publication: Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate