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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69fbc9ac83f34
DTSTART;TZID=America/Toronto:20200622T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200622T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/span-progra
 ms-and-quantum-time-complexity
SUMMARY:Span programs and quantum time complexity
CLASS:PUBLIC
DESCRIPTION:ARJAN CORNELISSEN - QUSOFT - UNIVERSITY OF AMSTERDAM\, JUNE 22\
 , 2020 AT\n2:30 P.M. ZOOM WEBINAR\n\nThe span program formalism is an impo
 rtant tool in the design of\nquantum algorithms. It is known that there is
  a constructive\ncorrespondence between span programs and quantum algorith
 ms with\noptimal query complexity\, making this framework especially suita
 ble\nfor designing query-efficient algortihms. However\, much less is know
 n\nabout the time complexity of the algorithms produced by this\nformalism
 .
DTSTAMP:20260506T230724Z
END:VEVENT
END:VCALENDAR