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.
@article{arxiv.2404.02658,
title = {Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts},
author = {A. G. de Oliveira and E. Diamond-Hitchcock and D. M. Walker and M. T. Wells-Pestell and G. Pelegrí and C. J. Picken and G. P. A. Malcolm and A. J. Daley and J. Bass and J. D. Pritchard},
journal= {arXiv preprint arXiv:2404.02658},
year = {2025}
}