BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:686a3c3699520
DTSTART;TZID=America/Toronto:20250314T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250314T163000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-connor-paddock
SUMMARY:Tutte colloquium-Connor Paddock
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE:A bound on the quantum value of all compiled 
 nonlocal games\n\nSPEAKER:\n Connor Paddock\n\nAFFILIATION:\n University o
 f Ottawa\n\nLOCATION:\n MC 5501\n\nABSTRACT: Nonlocal games provide valuab
 le insights into quantum\nentanglement and even enable a classical verifie
 r to confirm and\ncontrol the behavior of entangled quantum provers. Howev
 er\, an issue\nwith this approach has always been the necessity of two\nno
 n-communicating quantum provers. To address this issue\, a group of\nresea
 rchers recently introduced a \"compilation procedure\" that reduces\nthe n
 eed for multiple provers and enforces non-communication through\ncryptogra
 phic methods. In this talk\, we will show that even in this\nsingle prover
  \"compiled setting\,\" the prover remains fundamentally\nconstrained. Spe
 cifically\, we show that any polynomial-time quantum\nprover cannot win th
 e \"compiled game\" with a higher probability than\nany quantum commuting 
 provers could win the original nonlocal game.\nOur result is derived throu
 gh a novel combination of techniques from\ncryptography and operator algeb
 ras and allows us to recover several\nimportant self-testing results in th
 e \"compiled setting\".\n\n \n\n \n 
DTSTAMP:20250706T090454Z
END:VEVENT
END:VCALENDAR