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:20211207T055413Z
LOCATION:Online
DTSTART;TZID=America/Chicago:20211115T174500
DTEND;TZID=America/Chicago:20211115T181500
UID:submissions.supercomputing.org_SC21_sess345_ws_qcs120@linklings.com
SUMMARY:Mapping Constraint Problems onto Quantum Gate and Annealing Device
 s
DESCRIPTION:Workshop\n\nMapping Constraint Problems onto Quantum Gate and 
 Annealing Devices\n\nWilson, Mueller, Pakin\n\nThis work presents NchooseK
 , a unified programming model for constraint satisfaction problems that ca
 n be mapped to both quantum circuit and annealing devices through Quadrati
 c Unconstrained Binary Operators (QUBOs). Our mapping provides at least th
 e potential for a quantum advantage. We provide examples of NchooseK being
  used.\n\nTag: Online Only, Algorithms, Quantum Computing, Software Engine
 ering, System Software and Runtime Systems\n\nRegistration Category: Works
 hop Reg Pass
END:VEVENT
END:VCALENDAR