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:682a19cadb270
DTSTART;TZID=America/Toronto:20160104T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20160104T143000
URL:/institute-for-quantum-computing/events/colloquium-
 shalev-ben-david
SUMMARY:Colloquium: Shalev Ben-David
CLASS:PUBLIC
DESCRIPTION:Summary \n\nSEPARATIONS IN QUERY COMPLEXITY USING CHEAT SHEETS\
 n\nSHALEV BEN-DAVID\, MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT)\n\nWe sh
 ow a power 2.5 separation between bounded-error randomized and\nquantum qu
 ery complexity for a total Boolean function\, refuting the\nwidely believe
 d conjecture that the best such separation could only be\nquadratic (from 
 Grover's algorithm). We also present a total function\nwith a power 4 sepa
 ration between quantum query complexity and\napproximate polynomial degree
 \, showing severe limitations on the power\nof the polynomial method.\n 
DTSTAMP:20250518T173258Z
END:VEVENT
END:VCALENDAR