Demonstration of weighted graph optimization on a Rydberg atom array using local light-shifts

TL;DR

This paper demonstrates solving weighted graph optimization problems on a Rydberg atom array using local light-shifts, showcasing the potential for scalable quantum computation of complex graph problems.

Contribution

It introduces a method for implementing weighted graph optimization on Rydberg atom arrays with local light-shifts, including embedding complex graphs and demonstrating robust annealing.

Findings

Successful preparation of weighted graphs in 1D and 2D arrays

Embedding of a five vertex non-unit disk graph

Robust annealing ramps across various graph weights

Abstract

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.