Arctic: A Field Programmable Quantum Array Scheduling Technique
Ethan Decker

TL;DR
This paper introduces Arctic, a novel compiler pass for neutral atom quantum computers that optimizes qubit movement schedules, significantly improving speed, fidelity, and resource efficiency for complex algorithms.
Contribution
It presents the first movement-based compilation technique for reconfigurable neutral atom architectures, incorporating a stacking feature for enhanced algorithm support.
Findings
Reduces pulse counts by up to 5x
Increases fidelity by up to 7x
Achieves compilation times within seconds
Abstract
Advancements in neutral atom quantum computers have positioned them as a valuable framework for quantum computing, largely due to their prolonged coherence times and capacity for high-fidelity gate operations. Recently, neutral atom computers have enabled coherent atom shuttling to facilitate long-range connectivity as a high-fidelity alternative to traditional gate-based methods. However, these inherent advantages are accompanied by novel constraints, making it challenging to create optimal movement schedules. In this study I present, to the best of my knowledge, the first compiler pass designed to optimize reconfigurable coupling in zoned neutral atom architectures, while adhering to the reconfigurability constraints of these systems. I approach qubit mapping and movement scheduling as a max-cut and layered cross-minimization problem while enhancing support for spatially complex…
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
TopicsDistributed and Parallel Computing Systems
