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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682c2fb518166
DTSTART;TZID=America/Toronto:20190107T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190107T143000
URL:/institute-for-quantum-computing/events/quadratic-s
 peedup-finding-marked-vertex-quantum-walk
SUMMARY:Quadratic speedup in finding a marked vertex via quantum walk
CLASS:PUBLIC
DESCRIPTION:Summary \n\nSTACEY JEFFERY\, QUSOFT\, RESEARCH CENTRE FOR QUANT
 UM SOFTWARE\n\nA random walk on a graph\, P\, with marked vertex set M\, f
 inds a marked\nvertex using a O(HT(P\,M)) steps of the walk\, where HT(P\,
 M) is the\nhitting time. Previous quantum algorithms could detect the pres
 ence of\na marked vertex in O(sqrt{HT(P\,M)}) steps\, or find a marked ver
 tex in\nO(sqrt{HT(P\,M)}) steps if M contained at most one vertex\, but th
 e case\nof finding in the presence of multiple marked vertices was left as
  an\nopen problem.\n 
DTSTAMP:20250520T073101Z
END:VEVENT
END:VCALENDAR