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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e5d54defcd7
DTSTART;TZID=America/Toronto:20240708T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240708T153000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-com
 piler-quantum-circuit-synthesis-using-optimal
SUMMARY:Quantum compiler: quantum circuit synthesis using optimal control\n
 theory
CLASS:PUBLIC
DESCRIPTION:IQC SPECIAL SEMINAR - SAHEL ASHHAB\, NATIONAL INSTITUTE OF INFO
 RMATION\nAND COMMUNICATIONS\, JAPAN\n\nQNC building\, 200 University Ave. 
 Room 1201\, Waterloo \n\nWe use numerical optimal-control-theory methods 
 to determine the\nminimum number of two-qubit CNOT gates needed to perform
  quantum state\npreparation and unitary operator synthesis for few-qubit s
 ystems. In\nthe first set of calculations\, we consider all possible gate\
 nconfigurations for a given number of qubits and a given number of CNOT\ng
 ates\, and we determine the maximum achievable fidelity for the\nspecified
  parameters. This information allows us to identify the\nminimum number of
  gates needed to perform a specific target operation.\nIt also allows us t
 o enumerate the different gate configurations that\ncan be used for a perf
 ect implementation of the target operation. We\nfind that there are a larg
 e number of configurations that all produce\nthe desired result\, even at 
 the minimum number of gates. This last\nresult motivates the second set of
  calculations\, in which we consider\nonly a small fraction of the super-e
 xponentially large number of\npossible gate configurations for an increasi
 ng number of qubits. We\nfind that the fraction of gate configurations tha
 t allow us to achieve\nthe desired target operation increases rapidly as s
 oon as the number\nof gates exceeds the theoretical lower bound for the re
 quired number\nof gates. As a result\, a random search can be a highly eff
 icient\napproach for quantum circuit synthesis. Our results demonstrate th
 e\nimportant role that numerical optimal control theory can play in the\nd
 evelopment of quantum compilers.
DTSTAMP:20260420T072709Z
END:VEVENT
END:VCALENDAR