Classical Simulation of Quantum CSP Strategies

Demian Banakh, Lorenzo Ciardo, Marcin Kozik +1

We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra…