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:20250626T233527Z
LOCATION:B302-B305
DTSTART;TZID=America/New_York:20241120T100000
DTEND;TZID=America/New_York:20241120T170000
UID:submissions.supercomputing.org_SC24_sess533_post143@linklings.com
SUMMARY:QDD: Multi-Node Implementation of Decision Diagram-Based Quantum C
 ircuit Simulator with Ring Communication and Auto SWAP Insertion
DESCRIPTION:Yusuke Kimura and Junpei Koyama (Fujitsu Ltd) and Shaowen Li, 
 Hiroyuki Sato, and Masahiro Fujita (The University of Tokyo, Japan)\n\nThi
 s poster introduces QDD, a multi-node implementation of a decision diagram
  (DD)-based quantum circuit simulator. DD-based simulators offer faster si
 mulation of algorithms like Shor's compared to statevector (SV) simulators
  by compressing the quantum state using a graph representation. However, p
 arallelizing DD-based simulators has been challenging due to their dynamic
  data structures.\n\nQDD addresses this by distributing the quantum state 
 across multiple nodes and using ring communication to minimize communicati
 on overhead. Automatic SWAP gate insertion further optimizes communication
 . Experiments show QDD significantly outperforms the SV-based simulator in
  simulating Shor's algorithm. With 256 nodes, QDD achieves up to 10x faste
 r runtime compared to a single-node implementation. The experiment also ex
 amined the number of processes per node and found that one process per nod
 e was preferable unless rack-to-rack communication occurred.\n\nThe poster
  explains the background of quantum simulation and decision diagram, and t
 hen explains the multi-node method and experimental results in detail.\n\n
 Registration Category: Tech Program Reg Pass, Exhibits Reg Pass\n\nSession
  Chairs: Ayesha Afzal (Friedrich-Alexander University, Erlangen-Nuremberg;
  Erlangen National High Performance Computing Center); Sally Ellingson (Un
 iversity of Kentucky); and Alan Sussman (University of Maryland)\n\n
END:VEVENT
END:VCALENDAR
