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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682c2c5ead97e
DTSTART;TZID=America/Toronto:20181119T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181119T143000
URL:/institute-for-quantum-computing/events/quantum-pro
 of-systems-iterated-exponential-time-and-beyond
SUMMARY:Quantum proof systems for iterated exponential time\, and beyond
CLASS:PUBLIC
DESCRIPTION:Summary \n\nHENRY YUEN\, UNIVERSITY OF TORONTO\n\nAn outstandin
 g open question in quantum information theory concerns\nthe computational 
 complexity of nonlocal games. in a nonlocal game\, a\nclassical verifier i
 nteracts with multiple players that cannot\ncommunicate\, but are allowed 
 to share entanglement. In a recent\nbreakthrough result\, Slofstra showed 
 that the following problem is\nundecidable: given a nonlocal game\, is the
 re a quantum strategy for\nthe players to win with probability 1?\n 
DTSTAMP:20250520T071646Z
END:VEVENT
END:VCALENDAR