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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:684081cd590cd
DTSTART;TZID=America/Toronto:20200128T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200128T143000
URL:/institute-for-quantum-computing/events/new-insight
 s-about-quantum-approximate-counting
SUMMARY:New Insights About Quantum Approximate Counting
CLASS:PUBLIC
DESCRIPTION:Summary \n\nSPECIAL COLLOQUIUM FEATURING SCOTT AARONSON UNIVERS
 ITY OF TEXAS\,\nAUSTIN\n\nApproximate counting -- given a black-box functi
 on\nf:[N]->{0\,1}\, multiplicatively estimate the number of x's such that
 \nf(x)=1 -- is one of the most basic problems in quantum algorithms. In\n
 1998\, Brassard\, Hoyer\, Mosca\, and Tapp (BHMT) gave a fully quadratic\
 nquantum speedup for the problem\, while Nayak and Wu showed that this\ns
 peedup was optimal. What else is there to say?\n 
DTSTAMP:20250604T172637Z
END:VEVENT
END:VCALENDAR