MIP* = RE Part 1: The Quantum Low-Degree Test
summary
Shows a concrete protocol that self-tests for 2^n EPR pairs by certifying Pauli relations on many qubits. It combines the magic‑square subtest to force anti‑commutation, a linearity/low‑degree subtest to certify multiplicative relations, and consistency checks, so the provers’ observables form an approximate representation of the n‑qubit Pauli group. Approximate relations are then rounded to an exact representation (Gowers–Hatami / Fourier‑style arguments), yielding an isometry that maps the state to many EPR pairs; the quantum low‑degree test makes this communication efficient.
AI-written summary · about
chapters (10)
- 0:00Intro
- 1:32Nonlocal games and MIP
- 5:01MIP*: the complexity landscape
- 6:27Upper-bounding MIP*: challenges
- 15:24Outline
- 23:58Magic Square: the Quantum Strategy
- 31:11Self-testing through representation theory
- 33:49Magic square as a self-test: the analysis
- 47:19Testing the relations: anticommutation
- 54:39Testing consistency
