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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68b7a74f25f41
DTSTART;TZID=America/Toronto:20180419T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180419T120000
URL:/institute-for-quantum-computing/events/polynomial-
 method-strikes-back-tight-quantum-query-bounds
SUMMARY:The Polynomial Method Strikes Back: Tight Quantum Query Bounds via\
 nDual Polynomials
CLASS:PUBLIC
DESCRIPTION:Summary \n\nROBIN KOTHARI\, MICROSOFT RESEARCH (PLEASE NOTE NEW
  DATE AND TIME)\n\nWe use the polynomial method to prove optimal or nearly
  optimal lower\nbounds on the quantum query complexity of several problems
 \, resolving\nopen questions from prior work. The problems studied include
 \nk-distinctness\, image size testing\, k-junta testing\, approximating\ns
 tatistical distance\, approximating Shannon entropy\, and\nsurjectivity.
 ​ Paper available at https://arxiv.org/abs/1710.09079.\nThis is joint wo
 rk with Mark Bun and Justin Thaler.\n 
DTSTAMP:20250903T022623Z
END:VEVENT
END:VCALENDAR