Reading Group: MIP*=RE
Winter term 20/21
Regular Date: Friday 16:00 - 18:00 (online via Zoom)
Coordinator(s): Matthias Caro, Markus Hasenöhrl
Talks and Speakers
- 2020-10-20 Discussion of topics
- 2020-11-05 Tsirelson's problem and (un-)computability of the entangled game value (Matthias Caro, notes)
- 2022-11-27 Tsirelson problem and Kirchberg's QWEP Conjecture (Aleksander Kubicki, notes)
- 2020-12-11 An introduction to Connes' embedding problem (Diego Martínez, notes)
- 2021-01-22 An introduction to Probabilistically Checkable Proofs (Alexander Kliesch, notes)
- 2021-02-26 An introduction to self-testing (Andreas Bluhm, notes)
- 2021-03-20 The Pauli Braiding Test (Yifan Jia, notes)
- 2021-04-23 Recursive Compression: From the compression theorem to the undecidability of approximating the quantum value of a game - Part 1 (Ángela Capel, notes)
- 2021-05-07 Recursive Compression: From the compression theorem to the undecidability of approximating the quantum value of a game - Part 2 (Ángela Capel, notes)
- 2021-06-04 Discussion of the talk "MIP* = RE: Putting Everything Together"
Material