Towards Optimal Graph Coloring Using Rydberg Atoms. Vitali, G., Viviani, P., Vercellino, C., Scarabosio, A., Scionti, A., Terzo, O., Giusto, E., & Montrucchio, B. In The International Conference for High Performance Computing, Networking, Storage, and Analysis, Research posters, 2021. Paper abstract bibtex 1 download Quantum mechanics is expected to revolutionize the computing landscape in the near future. Among the many candidate technologies for building universal quantum computers, Rydberg atoms-based systems stand out for being capable of performing both quantum simulations and working as gate-based universal quantum computers while operating at room temperature through an optical system. Moreover, they can potentially scale up to hundreds of quantum bits (qubits). In this work, we solve a Graph Coloring problem by iteratively 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.
@inproceedings{21:sc:quantum,
title = {Towards Optimal Graph Coloring Using Rydberg Atoms},
author = {Vitali, Giacomo and Viviani, Paolo and Vercellino, Chiara and Scarabosio, Andrea and Scionti, Alberto and Terzo, Olivier and Giusto, Edoardo and Montrucchio, Bartolomeo},
year = 2021,
booktitle = {The International Conference for High Performance Computing, Networking, Storage, and Analysis, Research posters},
location = {St. Louis, MO, USA},
publisher = {},
address = {},
pages = {},
doi = {},
isbn = {},
url = {https://sc21.supercomputing.org/presentation/?id=rpost113&sess=sess278},
abstract = {Quantum mechanics is expected to revolutionize the computing landscape in the near future. Among the many candidate technologies for building universal quantum computers, Rydberg atoms-based systems stand out for being capable of performing both quantum simulations and working as gate-based universal quantum computers while operating at room temperature through an optical system. Moreover, they can potentially scale up to hundreds of quantum bits (qubits). In this work, we solve a Graph Coloring problem by iteratively 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.},
numpages = {},
keywords = {quantum computing,graph coloring,graph,neutral atoms,quantum simulator,hpc}
}
Downloads: 1
{"_id":"ukTFgAyzwSErJQT62","bibbaseid":"vitali-viviani-vercellino-scarabosio-scionti-terzo-giusto-montrucchio-towardsoptimalgraphcoloringusingrydbergatoms-2021","author_short":["Vitali, G.","Viviani, P.","Vercellino, C.","Scarabosio, A.","Scionti, A.","Terzo, O.","Giusto, E.","Montrucchio, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Towards Optimal Graph Coloring Using Rydberg Atoms","author":[{"propositions":[],"lastnames":["Vitali"],"firstnames":["Giacomo"],"suffixes":[]},{"propositions":[],"lastnames":["Viviani"],"firstnames":["Paolo"],"suffixes":[]},{"propositions":[],"lastnames":["Vercellino"],"firstnames":["Chiara"],"suffixes":[]},{"propositions":[],"lastnames":["Scarabosio"],"firstnames":["Andrea"],"suffixes":[]},{"propositions":[],"lastnames":["Scionti"],"firstnames":["Alberto"],"suffixes":[]},{"propositions":[],"lastnames":["Terzo"],"firstnames":["Olivier"],"suffixes":[]},{"propositions":[],"lastnames":["Giusto"],"firstnames":["Edoardo"],"suffixes":[]},{"propositions":[],"lastnames":["Montrucchio"],"firstnames":["Bartolomeo"],"suffixes":[]}],"year":"2021","booktitle":"The International Conference for High Performance Computing, Networking, Storage, and Analysis, Research posters","location":"St. Louis, MO, USA","publisher":"","address":"","pages":"","doi":"","isbn":"","url":"https://sc21.supercomputing.org/presentation/?id=rpost113&sess=sess278","abstract":"Quantum mechanics is expected to revolutionize the computing landscape in the near future. Among the many candidate technologies for building universal quantum computers, Rydberg atoms-based systems stand out for being capable of performing both quantum simulations and working as gate-based universal quantum computers while operating at room temperature through an optical system. Moreover, they can potentially scale up to hundreds of quantum bits (qubits). In this work, we solve a Graph Coloring problem by iteratively 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.","numpages":"","keywords":"quantum computing,graph coloring,graph,neutral atoms,quantum simulator,hpc","bibtex":"@inproceedings{21:sc:quantum,\r\n title = {Towards Optimal Graph Coloring Using Rydberg Atoms},\r\n author = {Vitali, Giacomo and Viviani, Paolo and Vercellino, Chiara and Scarabosio, Andrea and Scionti, Alberto and Terzo, Olivier and Giusto, Edoardo and Montrucchio, Bartolomeo},\r\n year = 2021,\r\n booktitle = {The International Conference for High Performance Computing, Networking, Storage, and Analysis, Research posters},\r\n location = {St. Louis, MO, USA},\r\n publisher = {},\r\n address = {},\r\n pages = {},\r\n doi = {},\r\n isbn = {},\r\n url = {https://sc21.supercomputing.org/presentation/?id=rpost113&sess=sess278},\r\n abstract = {Quantum mechanics is expected to revolutionize the computing landscape in the near future. Among the many candidate technologies for building universal quantum computers, Rydberg atoms-based systems stand out for being capable of performing both quantum simulations and working as gate-based universal quantum computers while operating at room temperature through an optical system. Moreover, they can potentially scale up to hundreds of quantum bits (qubits). In this work, we solve a Graph Coloring problem by iteratively 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.},\r\n numpages = {},\r\n keywords = {quantum computing,graph coloring,graph,neutral atoms,quantum simulator,hpc}\r\n}\r\n","author_short":["Vitali, G.","Viviani, P.","Vercellino, C.","Scarabosio, A.","Scionti, A.","Terzo, O.","Giusto, E.","Montrucchio, B."],"key":"21:sc:quantum","id":"21:sc:quantum","bibbaseid":"vitali-viviani-vercellino-scarabosio-scionti-terzo-giusto-montrucchio-towardsoptimalgraphcoloringusingrydbergatoms-2021","role":"author","urls":{"Paper":"https://sc21.supercomputing.org/presentation/?id=rpost113&sess=sess278"},"keyword":["quantum computing","graph coloring","graph","neutral atoms","quantum simulator","hpc"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/paoloviviani/bibliography/master/viviani.bib","dataSources":["FtNJan832qddKbHDz","WR8eprAvs6fBPvjR2","ujpKmnnjrbovxsYJh","bnaxeHFm2N3eaGmGd","cqD6ryMyGP3TmcjSu","JbC4F4KbYHD7sX85r","GnCtnthnMfknJSnf2","stSboLh3KrjyZ46AQ"],"keywords":["quantum computing","graph coloring","graph","neutral atoms","quantum simulator","hpc"],"search_terms":["towards","optimal","graph","coloring","using","rydberg","atoms","vitali","viviani","vercellino","scarabosio","scionti","terzo","giusto","montrucchio"],"title":"Towards Optimal Graph Coloring Using Rydberg Atoms","year":2021,"downloads":1}