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:687529d0ae067
DTSTART;TZID=America/Toronto:20120717T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120717T130000
URL:/institute-for-quantum-computing/events/melanie-jen
 senworth-extending-welded-tree-speedup
SUMMARY:Melanie Jensenworth: Extending the welded tree speedup
CLASS:PUBLIC
DESCRIPTION:Summary \n\nMelanie Jensenworth\, University of Washington \n\n
 ABSTRACT\n\nA welded tree is a graph consisting of two binary trees \"weld
 ed\"\ntogether with a random cycle between the leaves. In 2003\, Childs et
 \nal. showed that a quantum walk has an exponential speedup over\nclassica
 l algorithms when traversing the graph from one root vertex to\nthe other.
  I give evidence that related graphs also have an\nexponential gap between
  classical algorithms and the quantum walk.\n 
DTSTAMP:20250714T160120Z
END:VEVENT
END:VCALENDAR