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:20210402T160045Z
LOCATION:Track 3
DTSTART;TZID=America/New_York:20201117T103000
DTEND;TZID=America/New_York:20201117T110000
UID:submissions.supercomputing.org_SC20_sess181_pap437@linklings.com
SUMMARY:Efficient 2D Tensor Network Simulation of Quantum Systems
DESCRIPTION:Paper\n\nEfficient 2D Tensor Network Simulation of Quantum Sys
tems\n\nPang, Hao, Dugad, Zhou, Solomonik\n\nSimulation of quantum systems
is challenging due to the exponential size of the state space. Tensor net
works provide a systematically improvable approximation for quantum states
. 2D tensor networks such as Projected Entangled Pair States (PEPS) are we
ll-suited for key classes of physical systems and quantum circuits.\nDirec
t contraction of PEPS networks, however, has exponential cost, while appro
ximate algorithms require computations with large tensors. We propose new
scalable algorithms and software abstractions for PEPS-based methods, acce
lerating the bottleneck operation of contraction and refactorization of a
tensor subnetwork. We employ randomized SVD with an implicit matrix to red
uce cost and memory footprint asymptotically. Further, we develop a distri
buted-memory PEPS library and study accuracy and efficiency of alternative
algorithms for PEPS contraction and evolution on the Stampede2 supercompu
ter. We also simulate a popular near-term quantum algorithm, the Variation
al Quantum Eigensolver (VQE), and benchmark Imaginary Time Evolution (ITE)
, which compute ground states of Hamiltonians.\n\nTag: Quantum Computing,
Simulation\n\nRegistration Category: Tech Program Reg Pass
END:VEVENT
END:VCALENDAR