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:20211207T055401Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20211118T083000
DTEND;TZID=America/Chicago:20211118T170000
UID:submissions.supercomputing.org_SC21_sess280_rpost113@linklings.com
SUMMARY:Towards Optimal Graph Coloring Using Rydberg Atoms
DESCRIPTION:Posters, Research Posters\n\nTowards Optimal Graph Coloring Us
 ing Rydberg Atoms\n\nVitali, Viviani, Vercellino, Scarabosio, Scionti...\n
 \nQuantum mechanics is expected to revolutionize the computing landscape i
 n the near future.  Among the many candidate technologies for building uni
 versal quantum computers, Rydberg atoms-based systems stand out for being 
 capable of performing both quantum simulations and working as gate-based u
 niversal quantum computers while operating at room temperature through an 
 optical system. Moreover, they can potentially scale up to hundreds of qua
 ntum bits (qubits). In this work, we solve a Graph Coloring problem by ite
 ratively computing the solutions of Maximal Independent Set (MIS) problems
 , exploiting the Rydberg blockade phenomenon. Experimental results using a
  simulation framework on the CINECA Marconi-100 supercomputer demonstrate 
 the validity of the proposed approach.\n\nRegistration Category: Tech Prog
 ram Reg Pass, Exhibit Hall Only
END:VEVENT
END:VCALENDAR
