Quantum proof systems for iterated exponential time, and beyond
Henry Yuen, University of Toronto
An outstanding open question in quantum information theory concerns the computational complexity of nonlocal games. in a nonlocal game, a classical verifier interacts with multiple players that cannot communicate, but are allowed to share entanglement. In a recent breakthrough result, Slofstra showed that the following problem is undecidable: given a nonlocal game, is there a quantum strategy for the players to win with probability 1?