Towards Optimal Graph Coloring Using Rydberg Atoms
Authors/Creators
- 1. LINKS Foundation
- 2. Polytechnic University of Turin
Description
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.
Notes
Files
SC21.pdf
Files
(29.1 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:cf7ed690eaecae3a2d7e8ce3918e8254
|
29.1 MB | Preview Download |