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:69e688db59d25
DTSTART;TZID=America/Toronto:20190107T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190107T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quadratic-s
 peedup-finding-marked-vertex-quantum-walk
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Quadratic speedup in finding a marked vertex via quantum walk
CLASS:PUBLIC
DESCRIPTION:STACEY JEFFERY\, QUSOFT\, RESEARCH CENTRE FOR QUANTUM SOFTWARE\
 n\nA random walk on a graph\, P\, with marked vertex set M\, finds a marke
 d\nvertex using a O(HT(P\,M)) steps of the walk\, where HT(P\,M) is the\nh
 itting time. Previous quantum algorithms could detect the presence of\na m
 arked vertex in O(sqrt{HT(P\,M)}) steps\, or find a marked vertex in\nO(sq
 rt{HT(P\,M)}) steps if M contained at most one vertex\, but the case\nof f
 inding in the presence of multiple marked vertices was left as an\nopen pr
 oblem.
DTSTAMP:20260420T201315Z
END:VEVENT
END:VCALENDAR