BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210808T235336Z
LOCATION:Room C
DTSTART;TZID=America/Chicago:20210809T104500
DTEND;TZID=America/Chicago:20210809T110000
UID:icpp_ICPP 2021_sess136_dads_pap103@linklings.com
SUMMARY:Constraint Solving by Quantum Annealing
DESCRIPTION:PDADS Workshop\n\nConstraint Solving by Quantum Annealing\n\nC
odognet\n\nWe present experiments in solving combinatorial optimization an
d constraint satisfaction problems by means of Quantum Annealing. We descr
ibe how to model classic constraint problems such as N-queens and magic sq
uare as well as hard combinatorial problems such as the Costas Array Probl
em or the Quadratic Assignment Problem in terms of QUBO (Quadratic Unconst
rained Binary Optimization). QUBO is the input language of quantum compute
rs based on quantum annealing such as the D-Wave systems and of the "quant
um-inspired" but classical devices such as Fujitsu's Digital Annealing Uni
t or Hitachi's CMOS Annealing Machine. We present preliminary results for
solving these combinatorial optimization and constraint satisfaction prob
lems by implementation on the D-Wave quantum computer.
END:VEVENT
END:VCALENDAR