E. Diamond-Hitchcock | Searcharxiv

arXiv2024

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

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.

quant-ph↗

arXiv2023

Randomized Benchmarking using Non-Destructive Readout in a 2D Atom Array

Neutral atoms are a promising platform for scalable quantum computing, however prior demonstration of high fidelity gates or low-loss readout methods have employed restricted numbers of qubits. Using randomized benchmarking of microwave-driven single-qubit gates, we demonstrate average gate errors of $7(2)\times10^{-5}$ on a 225 site atom array using conventional, destructive readout. We further demonstrate a factor of 1.7 suppression of the primary measurement errors via low-loss, non-destructive and state-selective readout on 49 sites whilst achieving gate errors of $2(9)\times10^{-4}$.

quant-ph↗