BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260402T024532Z
LOCATION:3003\, Level 3
DTSTART;TZID=America/Los_Angeles:20250624T144500
DTEND;TZID=America/Los_Angeles:20250624T150000
UID:dac_DAC 2025_sess126_RESEARCH2460@linklings.com
SUMMARY:Hardware-Software Co-design for Distributed Quantum Computing
DESCRIPTION:Ji Liu (Argonne National Laboratory), Allen Zang (University o
 f Chicago), Martin Suchara (Microsoft), Tian Zhong (University of Chicago)
 , and Paul Hovland (Argonne National Laboratory)\n\nDistributed quantum co
 mputing (DQC) offers a promising pathway for scaling up quantum computing.
  Entanglement is indispensable for implementing non-local operations in DQ
 C, especially the teleportation of quantum states and gates. Practical rem
 ote entanglement generation is probabilistic, whose duration is not only l
 onger than local operations but also nondeterministic. Therefore, the opti
 mization of DQC architectures with probabilistic remote entanglement gener
 ation is critically important. In this paper, we study a new DQC architect
 ure which combines (1) asynchronously attempted entanglement generation, (
 2) buffering of successfully generated entanglement, and (3) adaptive sche
 duling of remote gates based on entanglement generation pattern. Our hardw
 are-software co-design improves both runtime and output fidelity for reali
 stic DQC.\n\nTopics: Design\n\nTracks: DES6: Quantum Computing\n\nSession 
 Chairs: Saurabh Kotiyal (Altera) and Sanjaya Lohani (Southern Methodist Un
 iversity)\n\n
END:VEVENT
END:VCALENDAR