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:20260522T150116Z
LOCATION:D161
DTSTART;TZID=America/Chicago:20181111T111000
DTEND;TZID=America/Chicago:20181111T113000
UID:submissions.supercomputing.org_SC18_sess156_ws_pmes108@linklings.com
SUMMARY:Memory-Efficient Quantum Circuit Simulation by Using Lossy Data Co
 mpression
DESCRIPTION:Xin-Chuan Wu (University of Chicago, Argonne National Laborato
 ry); Sheng Di, Franck Cappello, Hal Finkel, and Yuri Alexeev (Argonne Nati
 onal Laboratory); and Frederic T. Chong (University of Chicago)\n\nIn orde
 r to evaluate, validate, and refine the design of new quantum algorithms o
 r quantum computers, researchers and developers need methods to assess the
 ir correctness and fidelity. This requires the capabilities of quantum cir
 cuit simulations. However, the number of quantum state amplitudes increase
 s exponentially with the number of qubits, leading to the exponential grow
 th of the memory requirement for the simulations.\n\nIn this work, we pres
 ent our memory-efficient quantum circuit simulation by using lossy data co
 mpression.  Our empirical data shows that we reduce the memory requirement
  to 16.5% and 2.24E-06 of the original requirement for QFT and Grover's se
 arch, respectively. This finding further suggests that we can simulate dee
 p quantum circuits up to 63 qubits with 0.8 petabytes memory.\n\nTag: Arch
 itectures, Heterogeneous Systems, Quantum Computing\n\nRegistration Catego
 ry: Workshop Reg Pass\n\nSession Chair: Jeffrey S. Vetter (Oak Ridge Natio
 nal Laboratory (ORNL))\n\n
END:VEVENT
END:VCALENDAR