Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors
Pierre Cazals, Aymeric Fran\c{c}ois, Lo\"ic Henriet, Lucas Leclerc,, Malory Marin, Yassine Naghmouchi, Wesley da Silva Coelho, Florian Sikora,, Vittorio Vitale, R\'emi Watrigant, Monique Witt Garzillo, Constantin, Dalyac

TL;DR
This paper investigates the hardness of specific instances of the maximum independent set problem on neutral atom quantum processors, highlighting the challenges and potential for quantum advantage at larger scales.
Contribution
It introduces a method to generate hard MIS instances based on complexity theory and compares classical and quantum approaches, outlining the path toward quantum advantage.
Findings
Hard instances show exponential classical runtime growth with increased parameters
Quantum solutions are currently slower than classical ones at small scales
Scaling to 1000 atoms may be necessary to observe quantum advantage
Abstract
The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world applications, there has been significant experimental interest in exploring quantum advantage for MIS. Pioneering experiments on King's Lattice graphs suggested a quadratic speed-up over simulated annealing, but recent benchmarks using state-of-the-art methods found no clear advantage, likely due to the structured nature of the tested instances. In this work, we generate hard instances of unit-disk graphs by leveraging complexity theory results and varying key hardness parameters such as density and treewidth. For a fixed graph size, we show that increasing these parameters can lead to prohibitive classical runtime increases of several orders of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
