A Study on Quantum Compiler for Reconfigurable Neutral Atom Arrays

Reconfigurable Neutral Atom Arrays (RAAs) are a new form of realization of quantum circuits which store and arrange the movement of entire rows and columns of neutral atoms. The arrangement of RAAs comes with strict constraints that make routing a challenging optimization problem. Building on the Atomique compiler, this thesis introduces a router utilizing integer linear programming tailored to ICM circuits. The new algorithm produces more efficient schedules with slightly higher fidelity than the original greedy approach. Together, the results confirm that a globally optimized routing framework can meaningfully lower circuit depth without sacrificing fidelity, thus advancing the practical deployment of mobile neutral-atom arrays and paving the way for native support of larger, structurally diverse quantum circuits.