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:20260422T143141Z
LOCATION:B309
DTSTART;TZID=America/New_York:20241118T140600
DTEND;TZID=America/New_York:20241118T140900
UID:submissions.supercomputing.org_SC24_sess753_ws_whpc118@linklings.com
SUMMARY:High-Performance Quantum Simulation with Adaptive Circuit Knitting
DESCRIPTION:K. Grace Johnson (Hewlett Packard Enterprise (HPE))\n\nSimulat
 ing quantum systems is a promising application for quantum computing. Howe
 ver, quantum computers of sufficient scale and quality to study scientific
 ally interesting systems beyond the limit of classical computers do not ye
 t exist. It will be necessary in the near term to efficiently partition an
 d distribute quantum workloads in an HPC environment. Circuit knitting pro
 vides a path to simulating large systems on quantum devices of a limited s
 ize by reconstructing observables from smaller sub-circuits, but this reco
 nstruction comes at an exponential cost. We present an adaptive circuit kn
 itting method which finds efficient partitions of quantum circuits by disc
 overing regions of minimal entanglement between subsystems. We apply this 
 method to simulating the dynamics of strongly-disordered quantum spin chai
 ns, and show reductions in the cost of circuit knitting of one to two orde
 rs of magnitude.\n\nTag: Broader Engagement, HPC in Society, Inclusivity\n
 \nRegistration Category: Workshop Reg Pass\n\nSession Chairs: Elsa J. Gons
 iorowski (Lawrence Livermore National Laboratory (LLNL)) and Mozhgan Kabir
 i chimeh (NVIDIA Corporation)\n\n
END:VEVENT
END:VCALENDAR