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:69db3a884f411
DTSTART;TZID=America/Toronto:20180419T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180419T120000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/polynomial-
 method-strikes-back-tight-quantum-query-bounds
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:The Polynomial Method Strikes Back: Tight Quantum Query Bounds via\
 nDual Polynomials
CLASS:PUBLIC
DESCRIPTION:ROBIN KOTHARI\, MICROSOFT RESEARCH (PLEASE NOTE NEW DATE AND TI
 ME)\n\nWe use the polynomial method to prove optimal or nearly optimal low
 er\nbounds on the quantum query complexity of several problems\, resolving
 \nopen questions from prior work. The problems studied include\nk-distinct
 ness\, image size testing\, k-junta testing\, approximating\nstatistical d
 istance\, approximating Shannon entropy\, and\nsurjectivity.​ Paper avai
 lable at https://arxiv.org/abs/1710.09079.\nThis is joint work with Mark B
 un and Justin Thaler.
DTSTAMP:20260412T062408Z
END:VEVENT
END:VCALENDAR