Welcome to the MIP* Resource page. Here is a collection of resources that may be helpful for those interested in understanding the MIP* = RE result.
- A high level blog post that introduces the connection between MIP* = RE, Tsirelson's problem, and Connes' Embedding Conjecture.
- Here is a guide for people who are interested in starting a reading group around the MIP* = RE result, including its connections to the Connes' Embedding Problem. This includes suggestions for background reading.
- Many Faceted Connes Embedding Problem workshop at Banff International Research Station. Speakers: various.
- How to compress a nonlocal game. Speaker: Henry Yuen. Gives an overview of the compression scheme used in MIP* = RE.
- Self-testing as an approach to certifying quantum systems. Speaker: Andrea Coladangelo. Gives an overview of nonlocal game rigidity/self-testing.
- The algebraic side of MIP*=RE. Speaker: William Slofstra. Gives an algebraic viewpoint of the connection between CEP and MIP* = RE.
- The Quantum Low-Degree Test. Speaker: Anand Natarajan. Gives an introduction to the robust self-testing result that underlies the introspection technique.
- PCPs and Introspection. Speaker: John Wright. Gives an overview of the introspection technique.
- Spooky Complexity at a Distance. Speaker: Zhengfeng Ji. Gives an overview of MIP* = RE in the context of quantum multiprover interactive proofs.
There's a Piazza forum for those who may have questions about MIP* = RE or related topics. Sign up code: “quantum”.
Please contact me (Henry Yuen) if you'd like your reading group to be included on this list.
- Construct a non-hyperlinear group.
- What is the most general class of question distributions that can be introspected?
- What is the complexity of MIPco, or equivalently, the complexity of approximating the commuting operator value of nonlocal games? A plausible conjecture is that it is equal to coRE.
More to come. Also, please feel free to suggest more open problems (either by e-mail, or on the Piazza forum).