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:20230712T175212Z
LOCATION:3003\, 3rd Floor
DTSTART;TZID=America/Los_Angeles:20230711T112500
DTEND;TZID=America/Los_Angeles:20230711T114000
UID:dac_DAC 2023_sess128_RESEARCH821@linklings.com
SUMMARY:Scalable Optimal Layout Synthesis for NISQ Quantum Processors
DESCRIPTION:Research Manuscript\n\nWan-Hsuan Lin, Jason Kimko, and Bochen 
 Tan (University of California, Los Angeles); Nikolaj Bjorner (Microsoft); 
 and Jason Cong (University of California, Los Angeles)\n\nHaving a layout 
 synthesis tool with high solution quality is important to maximize circuit
  performance and fidelity for NISQ application. Previous heuristic approac
 hes have been shown to be far from optimal. Alternatively, exact approache
 s are not scalable due to inefficient encodings and slow optimization meth
 ods in constraint solvers. In this paper, we propose a scalable optimal la
 yout synthesis tool with a succinct formulation and better encoding techni
 ques. Experimental results show that our tool can achieve 2327x speedup ov
 er the state-of-the-art exact synthesizer. Compared to the leading heurist
 ic synthesizer, we can achieve 18x depth reduction and reduce SWAP by 62%.
 \n\nTopic: Design\n\nKeyword: Quantum Computing
END:VEVENT
END:VCALENDAR
