- Accepted Paper
Iterative optimization with partial convergence guarantees on neutral atom quantum computers
Phys. Rev. Research - Accepted 20 November, 2026
DOI: https://doi.org/10.1103/txz1-dfxf
Phys. Rev. Research - Accepted 20 November, 2026
DOI: https://doi.org/10.1103/txz1-dfxf
Neutral atom quantum computers (NAQCs) have emerged as a promising platform for solving the maximum weighted independent set (MWIS) problem. However, analog quantum approaches face two key limitations: Constraints of the atomic layout on realizable graph geometries and the absence of performance guarantees. We introduce , a hybrid quantum-classical framework that integrates an NAQC sampler into a classical cutting-plane algorithm. At each iteration, a relaxed linear program (RLP) bounds the MWIS and induces a reduced graph from which independent sets are sampled using an analog quantum sampler. A novel sample-informed separation problem guides odd-cycle cut selection and accelerates convergence. For t-perfect graphs, inherits polynomial-time convergence guarantees from the classical theory of cutting planes. We evaluate our approach on instances with up to 300 vertices—a scale that exceeds the capabilities of current NAQCs hardware. In this regime, reaches solutions within 5–10% of optimality, outperforming direct analog quantum protocols and greedy baselines under equal sampling budgets. As expected, simulated annealing remains the strongest sample-based solver at this scale. These results demonstrate how quantum samplers can be effectively embedded within classical optimization frameworks to deliver near-optimal solutions with reduced quantum resources while preserving formal guarantees.
If the author has provided any supplemental materials with this article they will be available upon publication of the version of record.