Reading webimar on the Connes-Kirchberg-Tsirelson problem
French Version, Back to the main page.
With Guillaume Aubrun (ICJ) and Omar Fawzi (LIP), we are organizing a working group on the Connes-Kirchberg-Tsirelson problem and the announcement of its resolution in the negative by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright and Henry Yuen. This working group mainly brings together mathematicians and computer scientists from Lyon and Toulouse.
The webinar takes place on Thursdays at 10:00 am. The first presentations took place at the UMPA, with a retransmission by Renavisio to allow colleagues from Toulouse to participate. With the sanitary situation and the containment, the webinar became completely online. We use the free system BigBlueButton, installed on the ENS de Lyon servers. The working group is open to everyone, just send an email to one of the organizers to get the connection details.
List of talks (past and future)
- 06/02 2020: Omar Fawzi et Mikael de la Salle : ``Introductory talk".
- 13/02 2020: Amine Marrakchi "Physical interpretation of quantum games".
- 20/02 2020: Alexander Mueller-Hermes et Emilie Mai Elkiaer. "Non-closure of the set of quantum correlations via graphs (following K. Dykema, V. Paulsen and J. Prakash)". References : arxiv:1703.08618 et arxiv:1709.05032. The speakers' notes are available here.
- 02/04 2020: Étienne Moutot "Turing machines and computability".
The speaker's notes are available here. The introductory book that Étenne advices is "Introduction to the Theory of Computation", by Michael Sipser.
- 09/04 2020: Guillaume Aubrun "The Navascués-Pironio-Acín hierarchy". Slides.
- 16/04 2020: Omar Fawzi `` ``From the game compression procedure to the
undecidability of approximating the quantum value of a game''. Reference : MIP*=RE, Slides.
- 30/04 2020: Cécilia Lancien (CNRS, IMT Toulouse) ``Exact self-testing for binary constraint system games''.
Summary: In this talk I will start with explaining the concept of
self-testing (aka rigidity) for non-local games. I will then present a
general approach which allows to prove self-testing results for a class
of games known as binary linear system games, through the representation
theory of their so-called solution group.
This talk will be mostly based on ideas and results appearing here and here.
Slides.
- 07/05 2020: Sophie Morel (CNRS, UMPA) ``Robust self-testing via approximate representations'' Slides.
- 28/05 2020: Bruno Sévennec (CNRS, UMPA) ``Around the PCP theorem'' Slides. Here are also some notes by Omar Fawzi on the PCP theorem and the complexity of two player games.
- 18/06 2020: Laurent Bartholdi (Georg-August University à, Goettingen,) ``Low-degree testing''. Handwritten notes.
- ... to be decided