Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929685167865856 |
|---|---|
| author | de Oliveira, A. G. Diamond-Hitchcock, E. Walker, D. M. Wells-Pestell, M. T. Pelegrí, G. Picken, C. J. Malcolm, G. P. A. Daley, A. J. Bass, J. Pritchard, J. D. |
| author_facet | de Oliveira, A. G. Diamond-Hitchcock, E. Walker, D. M. Wells-Pestell, M. T. Pelegrí, G. Picken, C. J. Malcolm, G. P. A. Daley, A. J. Bass, J. Pritchard, J. D. |
| contents | Neutral atom arrays have emerged as a versatile platform towards scalable quantum computation and optimization. In this paper we present demonstrations of solving maximum weighted independent set problems on a Rydberg atom array using annealing with local light-shifts. We verify the ability to prepare weighted graphs in 1D and 2D arrays, including embedding a five vertex non-unit disk graph using nine physical qubits and demonstration of a simple crossing gadget. We find common annealing ramps leading to preparation of the target ground state robustly over a substantial range of different graph weightings. This work provides a route to exploring large-scale optimization of non-planar weighted graphs relevant for solving relevant real-world problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02658 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts de Oliveira, A. G. Diamond-Hitchcock, E. Walker, D. M. Wells-Pestell, M. T. Pelegrí, G. Picken, C. J. Malcolm, G. P. A. Daley, A. J. Bass, J. Pritchard, J. D. Quantum Physics Atomic Physics Neutral atom arrays have emerged as a versatile platform towards scalable quantum computation and optimization. In this paper we present demonstrations of solving maximum weighted independent set problems on a Rydberg atom array using annealing with local light-shifts. We verify the ability to prepare weighted graphs in 1D and 2D arrays, including embedding a five vertex non-unit disk graph using nine physical qubits and demonstration of a simple crossing gadget. We find common annealing ramps leading to preparation of the target ground state robustly over a substantial range of different graph weightings. This work provides a route to exploring large-scale optimization of non-planar weighted graphs relevant for solving relevant real-world problems. |
| title | Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts |
| topic | Quantum Physics Atomic Physics |
| url | https://arxiv.org/abs/2404.02658 |