Differences

This shows you the differences between two versions of the page.

--- start [2020/08/26 01:36] – admin
+++ start [2020/08/28 15:58] – [Open Problems] admin
@@ Line 14: / Line 14: @@
   * [[https://simons.berkeley.edu/talks/tbd-140|The Quantum Low-Degree Test]]. Speaker: Anand Natarajan. Gives an introduction to the robust self-testing result that underlies the introspection technique.
   * [[https://simons.berkeley.edu/talks/tbd-139|PCPs and Introspection]]. Speaker: John Wright. Gives an overview of the introspection technique.
+  * [[https://www.youtube.com/watch?v=8Cmw5u8fazk|Spooky Complexity at a Distance]]. Speaker: Zhengfeng Ji. Gives an overview of MIP* = RE in the context of quantum multiprover interactive proofs.
+=====Discussion Forum====
+There's a [[http://piazza.com/utoronto.ca/summer2020/mipre|Piazza forum]] for those who may have questions about MIP* = RE or related topics. Sign up code: "quantum".
 =====Reading Groups=====
@@ Line 21: / Line 25: @@
   * [[http://perso.ens-lyon.fr/mikael.de.la.salle/GDT/GDT_Connes_Tsirelson.html.en|Reading webinar]], organized by Omar Fawzi, Mikael de la Salle, and Guillaume Aubrun. Slides and notes included.
+=====Open Problems=====
+  - Construct a [[hyperlinear|non-hyperlinear group]].
+  - What is the most general class of nonlocal games that can be [[introspection|introspected]]?
+  - What is the complexity of MIP<sup>co</sup>, or equivalently, the complexity of approximating the commuting operator value of nonlocal games? A plausible conjecture is that it is equal to [[core|coRE]].
+More to come. Also, please feel free to suggest more open problems (either by e-mail, or on the Piazza forum).