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:69e0166ce2e99
DTSTART;TZID=America/Toronto:20200128T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200128T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/new-insight
 s-about-quantum-approximate-counting
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:New Insights About Quantum Approximate Counting
CLASS:PUBLIC
DESCRIPTION:SPECIAL COLLOQUIUM FEATURING SCOTT AARONSON UNIVERSITY OF TEXAS
 \,\nAUSTIN\n\nApproximate counting -- given a black-box function\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\n1998\, Brass
 ard\, Hoyer\, Mosca\, and Tapp (BHMT) gave a fully quadratic\nquantum spe
 edup for the problem\, while Nayak and Wu showed that this\nspeedup was o
 ptimal. What else is there to say?
DTSTAMP:20260415T225124Z
END:VEVENT
END:VCALENDAR