Answers are grounded in this paper and cite their sources.
We theoretically investigate an analog implementation of the quantum approximate optimization algorithm (QAOA) for the weighted maximum cut problem (MaxCut) problem. The protocol uses a three-dimensional array of individually trapped Rydberg atoms driven by globally addressed laser pulses, with site-dependent detunings applied near the Rydberg resonance. As benchmarks, we consider twenty randomly weighted 3-regular graphs with 12 vertices each. Problem weights are encoded directly in the interatomic interaction energies by choosing appropriate three-dimensional atom positions. We compare two parameter-optimization strategies: discretized quantum annealing and warm-start initialization using a graph neural network (GNN). The combined optimization strategy creates a portfolio that outperforms the Goemans-Williamson (GW) rounding almost in all instances in the noiseless case. We analyze the sampling statistics and the total pulse-time cost of both approaches. Finally, we emulate the performance of the optimized schedules on quantum trajectories using a realistic error model of the Aquila neutral-atom quantum processor.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: