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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69fa219789e21
DTSTART;TZID=America/Toronto:20200608T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200608T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/towards-opt
 imal-separations-between-quantum-and-randomized
LOCATION:Webex Canada
SUMMARY:Towards Optimal Separations between Quantum and Randomized Query\nC
 omplexities
CLASS:PUBLIC
DESCRIPTION:COLLOQUIUM FEATURING AVISHAY TAL\, UNIVERSITY OF CALIFORNIA\, B
 ERKELEY\n\nThe query model offers a concrete setting where quantum algorit
 hms are\nprovably superior to randomized algorithms. Beautiful results by\
 nBernstein-Vazirani\, Simon\, Aaronson\, and others presented partial\nBoo
 lean functions that can be computed by quantum algorithms making\nmuch few
 er queries compared to their randomized analogs. To date\,\nseparations of
  $O(1)$ vs.
DTSTAMP:20260505T165759Z
END:VEVENT
END:VCALENDAR