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:69d5e0eab6da3
DTSTART;TZID=America/Toronto:20181121T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181121T133000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-algorithms-and
 -complexity-revisiting-simulation
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Seminar • Algorithms and Complexity — Revisiting the\nSimul
 ation of Quantum Turing Machines by Quantum Circuits
CLASS:PUBLIC
DESCRIPTION:ABEL MOLINA\, PHD CANDIDATE\n_David R. Cheriton School of Compu
 ter Science_\n\nYao (1993) proved that quantum Turing machines and uniform
 ly generated\nquantum circuits are polynomially equivalent computational m
 odels: t\n>= n steps of a quantum Turing machine running on an input of le
 ngth n\ncan be simulated by a uniformly generated family of quantum circui
 ts\nwith size quadratic in t\, and a polynomial-time uniformly generated\n
 family of quantum circuits can be simulated by a quantum Turing\nmachine r
 unning in polynomial time.
DTSTAMP:20260408T050026Z
END:VEVENT
END:VCALENDAR