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.
Towards Optimal Graph Coloring Using Rydberg Atoms [link]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