BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graph Games &amp\; Communication Complexity - Pierre BOTTERON (Uni
 versité de Toulouse)
DTSTART:20241205T143000Z
DTEND:20241205T145000Z
UID:TALK224641@talks.cam.ac.uk
DESCRIPTION:In quantum information\, nonlocal games are particularly usefu
 l for differentiating classical\, quantum\, and non-signalling correlation
 s. In this talk\, we present a generalization of the graph isomorphism gam
 e\, namely the "vertex distance game\," defined with a parameter D&isin\;
 ℕ. We characterize its perfect strategies\, both in the classical\, quan
 tum and non-signalling sense\, and we connect this notion with a refinemen
 t of fractional isomorphism of graphs\, namely D-fractional isomorphisms. 
 Surprisingly\, we observe that non-signalling strategies provide a finer d
 istinction for this game than classical and quantum strategies since the p
 arameter D is visible only in the non-signalling setting. Finally\, we giv
 e connections of this game with communication complexity by generating a P
 R box from a perfect non-signalling strategy.\nThis is a joint work with M
 oritz Weber [https://arxiv.org/pdf/2406.02199].
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR