BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T055413Z
LOCATION:Online
DTSTART;TZID=America/Chicago:20211115T140000
DTEND;TZID=America/Chicago:20211115T143000
UID:submissions.supercomputing.org_SC21_sess345_ws_qcs106@linklings.com
SUMMARY:QuantumCircuitOpt: An Open-Source Framework for Provably Optimal Q
 uantum Circuit Design
DESCRIPTION:Workshop\n\nQuantumCircuitOpt: An Open-Source Framework for Pr
 ovably Optimal Quantum Circuit Design\n\nNagarajan, Lockwood, Coffrin\n\nI
 n recent years, the quantum computing community has seen an explosion of n
 ovel methods to implement non-trivial quantum computations on near-term ha
 rdware. An important direction of research has been to decompose an arbitr
 ary entangled state, represented as a unitary, in to a quantum circuit, th
 at is, a sequence of gates supported by a quantum processor. It has been w
 ell known that circuits with longer decompositions and more entangling mul
 ti-qubit gates are error-prone for the current noisy-intermediate-scale qu
 antum devices. To this end, there has been a significant interest to devel
 op heuristic-based, methods to discover compact circuits.  We contribute t
 o this effort by proposing QuantumCircuitOpt (QCOpt), a novel open-source 
 framework which implements mathematical optimization formulations and algo
 rithms for decomposing arbitrary unitary matrices into a sequence of hardw
 are-native gates. A core innovation of QCOpt is that it provides optimalit
 y guarantees on the quantum circuits that it produces. In particular, we s
 how that QCOpt can find up to 33% reduction in the number of gates used, e
 ven on small qubit circuits (<= 3), with run times less than a few minutes
  on commodity computing hardware. We further validate the efficacy of QCOp
 t as a tool for quantum circuit design in comparison with a naive brute-fo
 rce enumeration algorithm. We also show how the QCOpt package can be adapt
 ed to various built-in types of native gate sets, based on different hardw
 are platforms like those currently produced by IBM, Rigetti and Google. We
  hope this package will facilitate further algorithmic exploration for qua
 ntum processor designers, as well as quantum physicists.\n\nTag: Online On
 ly, Algorithms, Quantum Computing, Software Engineering, System Software a
 nd Runtime Systems\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR