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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69da64e716320
DTSTART;TZID=America/Toronto:20160104T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20160104T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/colloquium-
 shalev-ben-david
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Colloquium: Shalev Ben-David
CLASS:PUBLIC
DESCRIPTION:SEPARATIONS IN QUERY COMPLEXITY USING CHEAT SHEETS\n\nSHALEV BE
 N-DAVID\, MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT)\n\nWe show a power 2
 .5 separation between bounded-error randomized and\nquantum query complexi
 ty for a total Boolean function\, refuting the\nwidely believed conjecture
  that the best such separation could only be\nquadratic (from Grover's alg
 orithm). We also present a total function\nwith a power 4 separation betwe
 en quantum query complexity and\napproximate polynomial degree\, showing s
 evere limitations on the power\nof the polynomial method.
DTSTAMP:20260411T151239Z
END:VEVENT
END:VCALENDAR