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:20260422T143138Z
LOCATION:B308
DTSTART;TZID=America/New_York:20241120T160000
DTEND;TZID=America/New_York:20241120T163000
UID:submissions.supercomputing.org_SC24_sess385_pap210@linklings.com
SUMMARY:Optimizing Quantum Fourier Transformation (QFT) Kernels for Modern
  NISQ and FT Architectures
DESCRIPTION:Yuwei Jin (Rutgers University); Xiangyu Gao (New York Universi
 ty (NYU)); Minghao Guo, Henry Chen, and Fei Hua (Rutgers University); Chi 
 Zhang (Independent); and Eddy Z. Zhang (Rutgers University)\n\nQuantum Fou
 rier Transformation (QFT) sits at the heart of many of these applications 
 in quantum computing. Existing work leverages SAT solver or heuristics to 
 generate a hardware-compliant circuit for QFT by inserting SWAP gates to r
 emap logical qubits to physical qubits. However, they might face problems 
 such as long compilation time and suboptimal outcome in terms of the numbe
 r of cycles to finish all operations. In this paper, we propose a domain-s
 pecific hardware mapping approach for QFT. We unify our insight of relaxed
  ordering and unit exploration in QFT to search for a qubit mapping soluti
 on with the help of program synthesis tools. Our method is the first one t
 hat guarantees linear-depth QFT circuits for Google Sycamore, IBM heavy-he
 x, and the lattice surgery, with respect to the number of qubits. Compared
  with state-of-the-art approaches, our method can save up to 53% in SWAP g
 ate and 92% in depth.\n\nTag: Post-Moore Computing, Quantum Computing\n\nR
 egistration Category: Tech Program Reg Pass\n\nAward Finalist: Best Studen
 t Paper Finalist\n\nSession Chair: Helena Liebelt (Deggendorf Institute of
  Technology, Germany; Intel Corporation)\n\n
END:VEVENT
END:VCALENDAR