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:20230124T171526Z
LOCATION:C140-142
DTSTART;TZID=America/Chicago:20221113T155000
DTEND;TZID=America/Chicago:20221113T161000
UID:submissions.supercomputing.org_SC22_sess423_ws_qcs124@linklings.com
SUMMARY:Memory-Efficient Differentiable Programming for Quantum Optimal Co
 ntrol of Discrete Lattices
DESCRIPTION:Workshop\n\nMemory-Efficient Differentiable Programming for Qu
 antum Optimal Control of Discrete Lattices\n\nWang, Kairys, Narayanan, Hue
 ckelheim\n\nQuantum optimal control problems are typically solved by gradi
 ent-based algorithms such as GRAPE, which suffer from exponential growth i
 n storage with increasing number of qubits and linear growth in memory req
 uirements with increasing number of time steps. Employing QOC for discrete
  lattice reveals that these memory requirements are a barrier for simulati
 ng large models or long time spans. We employ a nonstandard differentiable
  programming approach that significantly reduces the memory requirements a
 t the cost of a reasonable amount of recomputation. The approach exploits 
 invertibility properties of the unitary matrices to reverse the computatio
 n during back-propagation. We have created a QOC software in the different
 iable programming framework JAX that implements this approach, and demonst
 rate its effectiveness for lattice gauge theory.\n\nSession Format: Record
 ed\n\nTag: Quantum Computing\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR