Welcome
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.
Videos
-
-
-
-
The Quantum Low-Degree Test. Speaker: Anand Natarajan. Gives an introduction to the robust self-testing result that underlies the introspection technique.
-
-
Discussion Forum
There's a Piazza forum for those who may have questions about MIP* = RE or related topics. Sign up code: “quantum”.
Reading Groups
Please contact me (Henry Yuen) if you'd like your reading group to be included on this list.
-
Reading webinar, organized by Omar Fawzi, Mikael de la Salle, and Guillaume Aubrun. Slides and notes included.
Open Problems
-
What is the most general class of question distributions that can be
introspected?
What is the complexity of MIP
co, 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).