Quantum optimization with globally driven neutral atom arrays
Martin Lanthaler, Kilian Ender, Clemens Dlaska, Wolfgang Lechner

TL;DR
This paper introduces a scalable method for encoding complex combinatorial optimization problems on neutral atom arrays using global laser drives, leveraging modular gadgets and auxiliary atoms for problem encoding and interaction mitigation.
Contribution
It presents a novel approach to encode arbitrary connectivity problems, including higher-order terms, on neutral atom arrays with only global control, using modular gadgets and auxiliary atoms.
Findings
Efficient encoding of complex optimization problems on neutral atom arrays.
Use of auxiliary atoms for both problem encoding and interaction mitigation.
Scalable approach applicable to higher-order and arbitrary connectivity problems.
Abstract
We propose a scalable encoding of combinatorial optimization problems with arbitrary connectivity, including higher-order terms, on arrays of trapped neutral atoms requiring only a global laser drive. Our approach relies on modular arrangements of a small number of problem-independent gadgets. These gadgets represent maximum-weight independent set (MWIS) problems on unit-disk graphs, which are native to such devices. Instead of programming MWIS weights with site-dependent laser detunings, the scheme relies on systematic placements of auxiliary atoms. We show, that these auxiliary atoms can be simultaneously used for both problem-specific programming and the mitigation of unwanted effects originating from the tails of long-range interactions.
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
