Search Smarter, Not Harder: A Scalable, High-Quality Zoned Neutral Atom Compiler

Quantum Physics arXiv:2512.13790 (quant-ph) [Submitted on 15 Dec 2025] Title:Search Smarter, Not Harder: A Scalable, High-Quality Zoned Neutral Atom Compiler Authors:Yannick Stade, Lukas Burgholzer, Robert Wille View a PDF of the paper titled Search Smarter, Not Harder: A Scalable, High-Quality Zoned Neutral Atom Compiler, by Yannick Stade and 2 other authors View PDF HTML (experimental) Abstract:Zoned neutral atom architectures are emerging as a promising platform for large-scale quantum computing. Their growing scale, however, creates a critical need for efficient and automated compilation solutions. Yet, existing methods fail to scale to the thousands of qubits these devices promise. State-of-the-art compilers, in particular, suffer from immense memory requirements that limit them to small-scale problems. This work proposes a scalable compilation strategy that "searches smarter, not harder". We introduce Iterative Diving Search (IDS), a goal-directed search algorithm that avoids the memory issues of previous methods, and relaxed routing, an optimization to mitigate atom rearrangement overhead. Our evaluation confirms that this approach compiles circuits with thousands of qubits and, in addition, even reduces rearrangement overhead by 28.1% on average. The complete code is publicly available in open-source as part of the Munich Quantum Toolkit (MQT) at this https URL. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET) Cite as: arXiv:2512.13790 [quant-ph] (or arXiv:2512.13790v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.13790 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Yannick Stade [view email] [v1] Mon, 15 Dec 2025 19:00:02 UTC (479 KB) Full-text links: Access Paper: View a PDF of the paper titled Search Smarter, Not Harder: A Scalable, High-Quality Zoned Neutral Atom Compiler, by Yannick Stade and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-12 Change to browse by: cs cs.ET References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)