MIP* = RE

Explore a captivating lecture that delves into the intricate world of two-player games, quantum mechanics, and computational complexity. Journey through a fascinating intersection of physics, mathematics, and theoretical computer science as Thomas Vidick from Caltech presents at the Simons Institute 10th Anniversary Symposium. Discover the connections between Einstein, von Neumann, and Turing while unraveling concepts such as nonlocal correlations, Tsirelson's problem, operator algebras, and multi-prover interactive proofs. Gain insights into the complexity of verification, quantum linearity testing, and the compression of interactive proofs. This 57-minute talk offers a unique perspective on the power of quantum interactive proofs and their implications for our understanding of fundamental scientific principles.

Intro
Two-party correlations
Nonlocal correlations
Tsirelson's problem
The connection with operator algebras
Separating convex sets
The complexity of verification
Multi-prover interactive proofs
Games as linear functions
The power of quantum interactive proofs
(Quantum) linearity testing
Compression of interactive proofs
The punchline
Summary