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:20260730T152640Z
LOCATION:Exhibit Hall
DTSTART;TZID=America/Los_Angeles:20260728T174100
DTEND;TZID=America/Los_Angeles:20260728T174200
UID:dac_DAC 2026_sess306_LBR038@linklings.com
SUMMARY:Late Breaking Results: Novel Qubit Mapping for Two-Dimensional Tra
 pped-Ion Quantum Computing Systems
DESCRIPTION:Wei-Hsiang Tseng (The Electronic Design Automation Laboratory 
 Graduate Institute of Electronics Engineering National Taiwan University) 
 and Yao-Wen Chang and Jie-Hong Roland Jiang (National Taiwan University)\n
 \nEffective qubit mapping facilitates quantum algorithm implementations in
  physical quantum computing architectures. Recent work reported promising 
 qubit mapping on one-dimensional trapped-ion systems. Due to manufacturing
  complexity, however, it is insufficient to map all logical qubits into on
 e single qubit array in a large-scale quantum circuit; instead, we shall d
 ivide a quantum circuit into subcircuits for extending to two-dimensional 
 trapped-ion systems. Nevertheless, operating a two-qubit gate between diff
 erent subcircuits reduces the circuit fidelity. As a result, it is desirab
 le to develop an effective partitioning algorithm that can maintain fideli
 ty and minimize the execution time. This paper develops an effective divid
 e-and-conquer algorithm for each array. Unlike traditional min-cut partiti
 oning to balance the qubit number on each array, we propose a depth-aware 
 partitioning algorithm to expand the solution space for all mapping soluti
 ons and optimize the execution time on each array. Besides, we develop a s
 atisfiability modulo theories-based algorithm to optimize the mapping solu
 tion for each array. Experimental results show that our algorithm can aver
 agely achieve a 14% total time step reduction and a 30% total fidelity imp
 rovement for commonly used benchmarks.\n\nTrack: Student\n\n
END:VEVENT
END:VCALENDAR