Efficient algorithms to solve atom reconfiguration problems

Configurations of neutral atoms individually trapped in tightly-focused laser beams, aka tweezer arrays, provide a versatile platform to realize quantum spin models with programmable spatial geometries. Assembling large configurations of atoms by displacing atoms using dynamic optical traps requires solving atom reconfiguration problems. In this talk, I will describe two heuristic algorithms to solve atom reconfiguration problems [1, 2], as well as a low-latency feedback system to implement these algorithms. I will then benchmark the operational performance of the algorithms against exact and approximate algorithms, as well as the runtime performance of the low-latency reconfiguration system. I will finally discuss the experimental challenges of scaling up beyond a few thousand atoms. These results address the scalability challenge of atom-based platforms towards realizing quantum simulation of real materials with a practical quantum advantage.

[1] B. Cimring, R. E. Sabeh, M. Bacvanski, S. Maaz, I. E. Hajj, N. Nishimura, A. E. Mouawad, and A. Cooper, Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm, arXiv:2212.03885 [quant-ph].

[2] Remy El Sabeh, Jessica Bohm, Zhiqian Ding, Stephanie Maaz, Naomi Nishimura, Izzat El Hajj, Amer E. Mouawad, Alexandre Cooper, Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm, arXiv:2212.05586 [quant-ph].