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:20210402T160557Z
LOCATION:Track 3
DTSTART;TZID=America/New_York:20201111T150000
DTEND;TZID=America/New_York:20201111T152000
UID:submissions.supercomputing.org_SC20_sess194_ws_qcs109@linklings.com
SUMMARY:A QUBO Formulation for Qubit Allocation
DESCRIPTION:Workshop\n\nA QUBO Formulation for Qubit Allocation\n\nDury, D
i Matteo\n\nTo run an algorithm on a quantum computer, one must choose an
assignment from logical qubits in a circuit to physical qubits on quantum
hardware. This task of initial qubit placement, or qubit allocation, is e
specially important on present-day quantum computers which have a limited
number of qubits, connectivity constraints, and varying gate fidelities. \
n\nIn this work, we formulate and implement the qubit placement problem as
a quadratic, unconstrained binary optimization (QUBO) problem and solve i
t using simulated annealing to obtain a spectrum of initial placements. C
ompared to contemporary allocation methods available in tket and Qiskit, t
he QUBO method yields allocations with improved circuit depth for >50% of
a large set of benchmark circuits, with many also requiring fewer CX gates
.\n\nTag: Quantum Computing\n\nRegistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR