BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160544Z
LOCATION:Poster Module
DTSTART;TZID=America/New_York:20201119T083000
DTEND;TZID=America/New_York:20201119T170000
UID:submissions.supercomputing.org_SC20_sess337_rpost136@linklings.com
SUMMARY:Quantum Circuit Optimization with SPIRAL: A First Look
DESCRIPTION:Posters, Research Posters\n\nQuantum Circuit Optimization with
SPIRAL: A First Look\n\nMionis, Franchetti, Larkin\n\nOptimization of qua
ntum circuits is an integral part of the quantum computing toolchain. In m
any Noisy Intermediate-Scale Quantum (NISQ) devices, only loose connectivi
ty between qubits is maintained, meaning a valid quantum circuit often req
uires swapping physical qubits in order to satisfy adjacency requirements.
Optimizing circuits to minimize such swaps, as well as other parameters,
is imperative for utilizing the quantum hardware of the near future. In th
is work, we leverage SPIRAL, a code generation system for linear transform
s built on GAPâ€™s computer algebra system, and present an application towar
ds optimizing quantum circuits. SPIRAL natively understands tensor product
s, complex matrices and symbolic matrices, and its proven decomposition an
d rewriting capabilities are uniquely predisposed to optimize quantum circ
uits. Specifically, we construct a search problem that can be solved throu
gh dynamic programming. The optimal circuit can then be translated to QASM
code, where it is executed on a real quantum device.\n\nRegistration Cate
gory: Tech Program Reg Pass, Exhibits Reg Pass
END:VEVENT
END:VCALENDAR