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:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68364e81efafd
DTSTART;TZID=America/Toronto:20180205T093000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180205T093000
URL:/institute-for-quantum-computing/events/algorithms-
 and-complexity-quantum-advantage
SUMMARY:Algorithms and complexity for quantum advantage
CLASS:PUBLIC
DESCRIPTION:Summary \n\nDAVID GOSSET\, IBM TJ WATSON RESEARCH CENTER\n\nTh
 ere is strong evidence that a sufficiently large fault-tolerant\nquantum c
 omputer would solve certain computational problems\nexponentially faster t
 han any classical computer. How can quantum\nalgorithms and complexity the
 ory help guide the way forward in our\ncurrent era of small and noisy quan
 tum computers?\n 
DTSTAMP:20250527T234505Z
END:VEVENT
END:VCALENDAR