Emergency hub placement with a neutral-atom quantum computer

Abstract

We study the problem of emergency operation center placement in disaster response, where a minimal number of hubs must be selected to ensure timely coverage of all affected locations. This task can be formulated as a minimum dominating set problem on a graph encoding reachability within a target response time. We propose a hybrid quantum-classical approximation framework that leverages neutral-atom quantum computers as independent set samplers. Candidate dominating sets are constructed from both small maximal independent sets and complements of large independent sets, and are subsequently refined via a lightweight classical procedure. We benchmark the approach on synthetic instances and realistic case studies, and implement it on the Fresnel quantum processor by Pasqal, solving instances of up to 100 nodes. Our results show that quantum-generated samples, despite hardware noise, enable near-optimal solutions of the placement problem. Overall, our results demonstrate that neutral-atom devices operating in analog mode can already be used to tackle graph optimization problems for real-world applications.

Please cite this paper as:

@article{tarquini2026emergency,
  title={Emergency hub placement with a neutral-atom quantum computer},
  author={Tarquini, Sara and Vandelli, Matteo and Ferrari, Francesco and Dragoni, Daniele and Tudisco, Francesco},
  journal={arXiv preprint arXiv:2606.19589},
  year={2026}
}

Keywords: quantum computing neutral-atom quantum computing combinatorial optimization dominating set independent sets