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:20210402T160557Z
LOCATION:Track 3
DTSTART;TZID=America/New_York:20201111T122000
DTEND;TZID=America/New_York:20201111T124000
UID:submissions.supercomputing.org_SC20_sess194_ws_qcs103@linklings.com
SUMMARY:Logic Formulas as Program Abstractions for Quantum Circuits: A Cas
e Study in Noisy Variational Algorithm Simulation
DESCRIPTION:Workshop\n\nLogic Formulas as Program Abstractions for Quantum
Circuits: A Case Study in Noisy Variational Algorithm Simulation\n\nHuang
, Holtzen, Millstein, Van den Broeck, Martonosi\n\nExisting quantum circui
t simulators do not address the traits of variational algorithms, namely:\
n\n1) their ability to work with noisy qubits and operations,\n2) their re
peated execution of the same circuits but with different parameters, and\n
3) the fact that they sample from circuit final wavefunctions to drive opt
imization routines.\n\nOur key insight is that knowledge compilation—a tec
hnique for efficient repeated inference originating in AI research—can be
generalized to work on complex-valued quantum amplitudes, such that the te
chnique serves as the basis for a quantum circuit simulation toolchain gea
red for variational quantum algorithms. In knowledge compilation, AI mode
ls such as Bayesian networks encode probabilistic knowledge about the worl
d in a factorized format. The Bayesian networks compile down to minimized
logical formulas that enable repeated inference and sampling queries with
different parameters and new pieces of evidence. The features of the kno
wledge compilation approach—namely,\n\n1) the ability to represent probabi
listic information,\n2) the ability to compile probabilistic model structu
ral information into minimized formats, and\n3) the ability to efficiently
sample from the same model but for varying parameters and evidence—match
the requirements for variational quantum algorithm simulation.\n\nOur appr
oach offers performance advantages relative to simulation approaches based
on state vectors, density matrices, and tensor networks. The advantages
are due to the more compact representation, the circuit minimization and m
emoization capabilities of our approach, and due to the storage costs for
conventional simulators based on matrix representations. The improved sim
ulation performance facilitates studying variational algorithms in the NIS
Q era of quantum computing.\n\nTag: Quantum Computing\n\nRegistration Cate
gory: Workshop Reg Pass
END:VEVENT
END:VCALENDAR