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:6829b582c2fd7
DTSTART;TZID=America/Toronto:20141030T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20141030T113000
URL:/institute-for-quantum-computing/events/krysta-svor
 e-probabilistic-quantum-circuit-decomposition
SUMMARY:Krysta Svore: Probabilistic Quantum Circuit Decomposition
CLASS:PUBLIC
DESCRIPTION:Summary \n\nKRYSTA SVORE\, MICROSOFT RESEARCH\n\nRecently it ha
 s been shown that Repeat-Until-Success (RUS) circuits\ncan approximate a g
 iven single-qubit unitary with an expected number\nof T gates of about 1/3
  of what is required by optimal\, deterministic\,\nancilla-free decomposit
 ions over the Clifford+T gate set. In this\nwork\, we introduce a more gen
 eral and conceptually simpler circuit\ndecomposition method that allows fo
 r synthesis into protocols that\nprobabilistically implement quantum circu
 its over several universal\ngate sets including\, but not restricted to\, 
 the Clifford+T gate set.\n 
DTSTAMP:20250518T102506Z
END:VEVENT
END:VCALENDAR