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:20120311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20111106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d8e0fb15013
DTSTART;TZID=America/Toronto:20120717T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120717T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/melanie-jen
 senworth-extending-welded-tree-speedup
LOCATION:RAC - Research Advancement Centre 475 Wes Graham Way 2009 Waterloo
  ON N2L 6R2 Canada
SUMMARY:Melanie Jensenworth: Extending the welded tree speedup
CLASS:PUBLIC
DESCRIPTION:Melanie Jensenworth\, University of Washington \n\nABSTRACT\n\n
 A welded tree is a graph consisting of two binary trees \"welded\"\ntogeth
 er with a random cycle between the leaves. In 2003\, Childs et\nal. showed
  that a quantum walk has an exponential speedup over\nclassical algorithms
  when traversing the graph from one root vertex to\nthe other. I give evid
 ence that related graphs also have an\nexponential gap between classical a
 lgorithms and the quantum walk.
DTSTAMP:20260410T113731Z
END:VEVENT
END:VCALENDAR