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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d25ca93585a
DTSTART;TZID=America/Toronto:20220421T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220421T140000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/iqc-quics-m
 ath-and-computer-science-seminar-22
SUMMARY:IQC-QuICS Math and Computer Science Seminar
CLASS:PUBLIC
DESCRIPTION:UNIVERSAL EFFICIENT COMPILATION: SOLOVAY-KITAEV WITHOUT INVERSE
 S\n\nTUDOR GIURGICA-TIRON\, STANFORD UNIVERSITY\n\nThe Solovay-Kitaev algo
 rithm is a fundamental result in quantum\ncomputation. It gives an algorit
 hm for efficiently compiling arbitrary\nunitaries using universal gate set
 s: any unitary can be approximated\nby short gates sequences\, whose lengt
 h scales merely\npoly-logarithmically with accuracy. As a consequence\, th
 e choice of\ngate set is typically unimportant in quantum computing. Howev
 er\, the\nSolovay-Kitaev algorithm requires the gate set to be inverse-clo
 sed.
DTSTAMP:20260405T125921Z
END:VEVENT
END:VCALENDAR