Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures
Summarize this article with:
Quantum Physics arXiv:2603.19969 (quant-ph) [Submitted on 20 Mar 2026] Title:Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures Authors:Anabel Ovide, Andreu Angles-Castillo, Carmen G. Almudever View a PDF of the paper titled Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures, by Anabel Ovide and 2 other authors View PDF HTML (experimental) Abstract:Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures promise scalability through interconnected trap zones and dynamic ion transport; however, this transport capability creates a complex compilation challenge: how to move qubits efficiently without degrading fidelity. We introduce a routing strategy that turns this challenge into an advantage by exploiting operational parallelism across traps while adapting to both algorithmic structure and device topology through a configurable multi-parameter scoring mechanism. Across a broad suite of benchmarks and QCCD layouts, the method consistently reduces ion-transport overhead and improves execution fidelity, outperforming state-of-the-art routing techniques. These results highlight that explicitly balancing movement overhead and execution parallelism under architectural constraints is key to unlocking the full potential of modular trapped-ion quantum processors. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.19969 [quant-ph] (or arXiv:2603.19969v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.19969 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Anabel Ovide [view email] [v1] Fri, 20 Mar 2026 14:11:29 UTC (3,440 KB) Full-text links: Access Paper: View a PDF of the paper titled Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures, by Anabel Ovide and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 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?)