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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e585368e7e4
DTSTART;TZID=America/Toronto:20230302T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230302T160000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-wor
 st-case-average-case-reductions-all-linear
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Quantum Worst-Case to Average-Case Reductions for All Linear Proble
 ms
CLASS:PUBLIC
DESCRIPTION:MATH/CS SEMINAR - VAHID ASADI FROM IQC\n\nIn this talk\, we stu
 dy the problem of designing worst-case to\naverage-case reductions for qua
 ntum algorithms. For all linear\nproblems\, we provide an explicit and eff
 icient transformation of\nquantum algorithms that are only correct on a sm
 all (even\nsub-constant) fraction of their inputs into ones that are corre
 ct on\nall inputs. This stands in contrast to the classical setting\, wher
 e\nsuch results are only known for a small number of specific problems or\
 nrestricted computational models. En route\, we obtain a tight Ω(n^2)\nlo
 wer bound on the average-case quantum query complexity of the\nMatrix-Vect
 or Multiplication problem...
DTSTAMP:20260420T014526Z
END:VEVENT
END:VCALENDAR