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:69d1aab48f5fd
DTSTART;TZID=America/Toronto:20250314T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250314T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-connor-paddock
SUMMARY:Tutte colloquium-Connor Paddock
CLASS:PUBLIC
DESCRIPTION:TITLE:A bound on the quantum value of all compiled nonlocal gam
 es\n\nSPEAKER:\n Connor Paddock\n\nAFFILIATION:\n University of Ottawa\n\n
 LOCATION:\n MC 5501\n\nABSTRACT: Nonlocal games provide valuable insights 
 into quantum\nentanglement and even enable a classical verifier to confirm
  and\ncontrol the behavior of entangled quantum provers. However\, an issu
 e\nwith this approach has always been the necessity of two\nnon-communicat
 ing quantum provers. To address this issue\, a group of\nresearchers recen
 tly introduced a \"compilation procedure\" that reduces\nthe need for mult
 iple provers and enforces non-communication through\ncryptographic methods
 . In this talk\, we will show that even in this\nsingle prover \"compiled 
 setting\,\" the prover remains fundamentally\nconstrained. Specifically\, 
 we show that any polynomial-time quantum\nprover cannot win the \"compiled
  game\" with a higher probability than\nany quantum commuting provers coul
 d win the original nonlocal game.\nOur result is derived through a novel c
 ombination of techniques from\ncryptography and operator algebras and allo
 ws us to recover several\nimportant self-testing results in the \"compiled
  setting\".\n\n \n\n 
DTSTAMP:20260405T002004Z
END:VEVENT
END:VCALENDAR