Home /  Hot Topics: MIP* = RE and the Connes’ Embedding Problem

Workshop

Hot Topics: MIP* = RE and the Connes’ Embedding Problem October 16, 2023 - October 20, 2023
Registration Deadline: October 20, 2023 8 months ago
To apply for Funding you must register by: July 31, 2023 11 months ago
Parent Program: --
Series: Hot Topic, Hot Topic
Location: SLMath: Eisenbud Auditorium, Commons Room, Atrium
Organizers Michael Chapman (New York University, Courant Institute), Anand Natarajan (Massachusetts Institute of Technology), William Slofstra (University of Waterloo), John Wright (University of Texas, Austin), Henry Yuen (Columbia University)
Speaker(s)

Show List of Speakers

Description
Image
Drawing by Tina Zhang.
This workshop is about the recent MIP*=RE result from quantum computational complexity, and the resulting resolution of the Connes embedding problem from the theory of von Neumann algebras. MIP*=RE connects the disparate areas of computational complexity theory, quantum information, operator algebras, and approximate representation theory. The techniques used in the proof of MIP*=RE, such as self-testing and probabilistically checkable proofs, are well-known in theoretical computer science and quantum information, but are unfortunately completely foreign in operator algebras and approximate representation theory. Likewise, the tools of operator algebras and approximate representation theory are mostly unfamiliar in theoretical computer science and quantum information. This has made it challenging to translate the MIP*=RE result and the techniques used to prove it into a form digestible to operator algebraists. The aim of this workshop is to bridge this divide, by giving an in-depth exposition of the techniques used in the proof of MIP*=RE, and highlighting perspectives on the MIP*=RE result from operator algebras and approximate representation theory. In particular, this workshop will highlight connections with group stability, something that has not been covered in previous workshops. In addition to increasing understanding of the MIP*=RE proof, we hope that this will open up further applications of the ideas behind MIP*=RE in operator algebras. Bibliography Download a PDF flyer to share with your department or colleagues   Zoom Link: https://msri.zoom.us/j/93856043419?pwd=VlNEdE1nanNkRUpvN0I4NkkrUnF6dz09
Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Oct 16, 2023
Monday
09:15 AM - 09:30 AM
  Welcome
09:30 AM - 10:30 AM
  Introduction to MIP* = RE and Nonlocal Games
John Wright (University of Texas, Austin)
10:30 AM - 11:00 AM
  Break
11:00 AM - 12:00 PM
  Linearity Testing and Low-Degree Testing
Dana Moshkovitz aaronson
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  Introduction to Self-Testing
Yuming Zhao (University of Waterloo)
03:00 PM - 03:30 PM
  Afternoon Tea
03:30 PM - 04:30 PM
  Synchronous Games
Vern Paulsen (University of Waterloo)
Oct 17, 2023
Tuesday
09:30 AM - 10:30 AM
  The Compression Paradigm, Part I
Seyed Sajjad Nezhadi (University of Maryland)
10:30 AM - 11:00 AM
  Break
11:00 AM - 12:00 PM
  The Compression Paradigm, Part II
Henry Yuen (Columbia University)
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  Group Stability, Nonlocal Games, and Self-Testing
Michael Chapman (New York University, Courant Institute)
03:00 PM - 03:30 PM
  Afternoon Tea
03:30 PM - 04:30 PM
  Spectral Gap and Stability for Groups and Non-Local Games
Mikael de la Salle (CNRS)
04:30 PM - 06:20 AM
  Reception
Oct 18, 2023
Wednesday
09:30 AM - 10:30 AM
  Quantum Soundness of Low-Degree Test
Anand Natarajan (Massachusetts Institute of Technology)
10:30 AM - 11:00 AM
  Break
11:00 AM - 12:00 PM
  Quantum Graphs and Colorings
Priyanga Ganesan (University of California, San Diego)
12:00 PM - 12:30 PM
  A Remark on Compression
Andrew Marks (UC Berkeley)
12:00 PM - 02:00 PM
  Lunch
03:00 PM - 03:30 PM
  Afternoon Tea
Oct 19, 2023
Thursday
09:30 AM - 10:30 AM
  Model-Theoretic Consequences of MIP*=RE
Isaac Goldbring (University of California, Irvine)
10:30 AM - 10:35 AM
  Group Photo
10:35 AM - 11:00 AM
  Break
11:00 AM - 12:00 PM
  Products of Games and Parallel Repetition
Henry Yuen (Columbia University)
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  LCS-Games, Non-Hyperlinear Groups, and Schaefer Dichotomy Theorems
William Slofstra (University of Waterloo)
03:00 PM - 03:30 PM
  Afternoon Tea
03:30 PM - 04:30 PM
  Guided Discussion on Future Directions
Oct 20, 2023
Friday
09:30 AM - 10:30 AM
  Answer Reduction via Low-Degree Testing and PCPs
Anand Natarajan (Massachusetts Institute of Technology)
10:30 AM - 11:00 AM
  Break
11:00 AM - 12:00 PM
  Bisynchronous Correlations
Michael Brannan (University of Waterloo)
12:00 PM - 02:00 PM
  Lunch
02:00 PM - 03:00 PM
  Undecidability, Lawvere's Theorem, and Universality
Gemma De les Coves (Leopold-Franzens Universität Innsbruck)
03:00 PM - 03:30 PM
  Afternoon Tea
03:30 PM - 04:30 PM
  Interactive Proofs with S-Graphs
Michael Chapman (New York University, Courant Institute)