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:20140309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20131103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d8ced27081a
DTSTART;TZID=America/Toronto:20141030T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20141030T113000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/krysta-svor
 e-probabilistic-quantum-circuit-decomposition
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Krysta Svore: Probabilistic Quantum Circuit Decomposition
CLASS:PUBLIC
DESCRIPTION:KRYSTA SVORE\, MICROSOFT RESEARCH\n\nRecently it has been shown
  that Repeat-Until-Success (RUS) circuits\ncan approximate a given single-
 qubit unitary with an expected number\nof T gates of about 1/3 of what is 
 required by optimal\, deterministic\,\nancilla-free decompositions over th
 e Clifford+T gate set. In this\nwork\, we introduce a more general and con
 ceptually simpler circuit\ndecomposition method that allows for synthesis 
 into protocols that\nprobabilistically implement quantum circuits over sev
 eral universal\ngate sets including\, but not restricted to\, the Clifford
 +T gate set.
DTSTAMP:20260410T102002Z
END:VEVENT
END:VCALENDAR