Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.24714

Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures

Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, André Brinkmann

quant-phcs.AIcs.ETSubmitted Jul 27, 2026• Announced Jul 28, 2026• 2 citations• Revised Oct 16, 2026 (v2)
v1 · Jul 27, 2026v2 · Oct 16, 2026
arXivHTMLPDF

Abstract

Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the Python code of shuttling compilers from written specifications. Starting with a compiler for (i) a linear segmented trap, we extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are seeded with code from the previous ones. We benchmark the LLM-generated compilers against state-of-the-art hand-crafted ones using a common suite of quantum circuits. The number of shuttling timesteps is reduced by up to 72% for (i) and up to 43% for (ii). For the broad case (iii) of freely connected architectures, we find large variations in the required number of shuttling timesteps, depending on the connectivity. A densely connected, junction-rich architecture yields up to an order-of-magnitude reduction in shuttling timesteps compared to a corridor-like one. Repeating the complete generation and evaluation with a second frontier LLM, Claude Fable 5, reproduces these findings, with the Fable 5 compilers surpassing the hand-crafted ones more often on the largest circuits. Our results show that an unmodified frontier LLM can produce working, correct, and competitive shuttling compilers without additional manual algorithmic engineering. Generating compilers this way reduces the development time for new architectures from several months to a few days.

Comments
83 pages, 31 figures, 8 tables

Related papers

Shuttling Compiler for Trapped-Ion Quantum Computers Based on Fine-Tuned Large Language Models

Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler +1 more

In trapped-ion quantum computers, qubits must be shuttled between segments to interact. The routing logic that schedules these movements is written by hand for every new trap architecture. We present shuttling compilers based on five large language models (LLMs). Each LLM is fine-tuned on shuttling schedules produced by hand-coded heuristics for linear and branched one-dimensional trap architectures. We investigate how the shuttling operation counts of their schedules compare with those of the heuristics and how far they generalize to unseen architectures. For circuits of up to 16 qubits, the fine-tuned LLMs generate valid schedules on both training architectures, more often the fewer qubits a circuit has. In 12% of the compilations yielding a schedule, the best of ten runs needs up to 21% fewer operations than the heuristic baselines, after a rule-based post-processing step. A single run of one fine-tuned LLM produces a valid shuttling schedule for a previously unseen four-way branched architecture. This is preliminary evidence of cross-architecture generalization. On two other unseen architectures no LLM produces a valid schedule. Thus, LLM-learned shuttling compilation is feasible, and we show how far it currently reaches.

quant-pharXiv:2512.18021•Dec 23, 2025•3 citations

Shuttling Compiler for a Trapped-Ion Quantum Computer Architecture with Junctions

Fabian Kreppel, Christian Melzer, Janis Wagner +4 more

Current trapped-ion quantum computer architectures based on segmented traps utilize shuttling operations to establish connectivity between multiple sub-registers within one quantum processing unit. Complex trap architectures, including racetrack loops and junctions, offer prospects for increased scalability and have been successfully built and demonstrated. As hardware capabilities evolve, the need arises for additional automated software layers within the control stack for managing qubit routing. We present the automated generation of shuttling schedules for a branched ID architecture within a shuttling compiler that requires the integration of junctions. This not only provides the means for leveraging future new hardware advances, but also allows guiding the development of future architecture via resource estimation. Testing a wide range of quantum circuits, the junction-enabled shuttling compiler is able to reduce the necessary operations by a factor > 50 for translations and > 20 for separation/merge as compared to a linear architecture.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

An Improved Ion-Shuttling Approach for QCCD Architectures

Tung-Yeh Wu, Ting-Chi Wang

Trapped-ion quantum computers offer high-fidelity operations, long coherence times, and all-to-all connectivity within a single trap. However, scaling to large circuits is limited by the trap's ion capacity. The QCCD architecture addresses this by enabling ion shuttling across multiple traps, but excessive shuttling increases execution time and degrades fidelity. This paper presents an improved ion-shuttling approach targeting linear QCCD architectures. Building on a state-of-the-art approach [27] for linear trapped-ion devices, our approach introduces a front-layer-based scheduling method that dynamically prioritizes executable gates, along with a novel destination trap selection method for ion-shuttling, effectively reducing unnecessary ion movements. We also present a look-ahead gate selection strategy based on the gate dependency graph, avoiding the high runtime of the gate proximity approach used in the state-of-the-art approach, especially in circuits with all-to-all communication. Our approach achieves up to a 37.67% reduction in shuttle count and up to a 74.91% reduction in compilation time compared to the state-of-the-art approach for linear trapped-ion devices on actual NISQ benchmarks and synthetic circuits. On average, our approach achieves a 16.44% reduction in shuttle count and a 30.77% reduction in compilation time across all test cases. These improvements highlight the effectiveness of our approach, particularly for actual circuits.

International Symposium on Physical Design•Mar 15, 2026•0 citations

Heuristics for Shuttling Sequence Optimization for a Linear Segmented Trapped-Ion Quantum Computer

J. Durandau, C. A. Brunet, F. Schmidt-Kaler +3 more

An algorithm for the generation of shuttling sequences is necessary for the operation of a linear segmented ion-trap quantum computer. The present work provides an implementation of an algorithm that produces sequences proved to be optimal for circuits with a quantum Fourier transform-like structure. Such optimality was proved in previous work of our group. We first present an approach for qubit mapping, i.e. determining the initial ordering of the ions, termed the common ion order, and develop a heuristic algorithm for its implementation. We explain how this heuristic is integrated in the shuttling sequence generation algorithm described in the previous work. The results show the increased performance of the heuristic in terms of reducing the number of required shuttling operations. The number of ion displacements required exhibits a polynomial increase in terms of the number of qubits, such that these operations become the main contribution to the overall resource cost. Furthermore, we show that multiple zones for gate interactions can reduce the amount of qubit register reordering.

quant-pharXiv:2603.05464•Mar 6, 2026•4 citations

Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction

Bao Gia Bach, Ilya Safro, Ed Younis

With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the “position graph”, representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures, enabling high-quality, scalable compilation methods. Specifically, we propose scheduling algorithms called SHuttling-Aware PERmutative (SHAPER) and SHuttling-AWare (SHAW) heuristic searches to tackle the complex constraints and dynamics of trapped-ion machines, with the cooperation of state-of-the-art permutation-aware mapping. These approaches generate executable circuits and native instructions that respect the physical constraints of shuttling-based architectures. We evaluate proposed algorithms across theorized and real architectures using the position graph framework. For completeness, we also introduce a linear program of trapped-ion scheduling that yields the optimal schedules, enabling a direct comparison with our heuristics. Our algorithm can successfully compile programs for extreme architectures where prior algorithms fail. When the baseline does complete, our produced schedules are 1.45 times faster on average, with best-case speedups up to 4 times faster.

arXiv:2501.12470•ACM Transactions on Quantum Computing•Jul 14, 2026•14 citations

Robust Shuttling Compilation for Trapped-Ion Quantum Computers

Daniel Schoenberger, Robert Wille

Scalable trapped-ion quantum computers are expected to rely on two-dimensional grid architectures, in which ions are shuttled through a device with multiple junctions. These junctions are a known bottleneck and may become degraded, disabled, or otherwise unavailable, yet existing shuttling compilation approaches effectively assume an intact routing structure and do not address this failure mode. In this work, we introduce a robust shuttling compilation approach for trapped-ion QCCD architectures to close this gap. Our method extends existing shuttling compilation by a defect-tolerant path-based reconfiguration mechanism and combines it with prior cycle-based reconfiguration in a hybrid cycle-path strategy. This preserves efficiency when suitable cycles remain available while retaining functionality when junction failures disrupt the topology. We implement the approach in an open-source compiler and evaluate it under random and clustered defect patterns. The results show that the hybrid strategy preserves functionality in scenarios where cycle-only shuttling fails, while incurring only moderate overhead across different architecture scales, occupancies, and representative benchmark circuits. The evaluation furthermore provides a first systematic view of how increasing numbers of junction failures affect trapped-ion quantum computers.

IEEE International Conference on Quantum Software (QSW)•Jul 1, 2026•0 citations
Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the Python code of shuttling compilers from written specifications. Starting with a compiler for (i) a linear segmented trap, we extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are seeded with code from the previous ones. We benchmark the LLM-generated compilers against state-of-the-art hand-crafted ones using a common suite of quantum circuits. The number of shuttling timesteps is reduced by up to 72% for (i) and up to 43% for (ii). For the broad case (iii) of freely connected architectures, we find large variations in the required number of shuttling timesteps, depending on the connectivity. A densely connected, junction-rich architecture yields up to an order-of-magnitude reduction in shuttling timesteps compared to a corridor-like one. Repeating the complete generation and evaluation with a second frontier LLM, Claude Fable 5, reproduces these findings, with the Fable 5 compilers surpassing the hand-crafted ones more often on the largest circuits. Our results show that an unmodified frontier LLM can produce working, correct, and competitive shuttling compilers without additional manual algorithmic engineering. Generating compilers this way reduces the development time for new architectures from several months to a few days.
In trapped-ion quantum computers, qubits must be shuttled between segments to interact. The routing logic that schedules these movements is written by hand for every new trap architecture. We present shuttling compilers based on five large language models (LLMs). Each LLM is fine-tuned on shuttling schedules produced by hand-coded heuristics for linear and branched one-dimensional trap architectures. We investigate how the shuttling operation counts of their schedules compare with those of the heuristics and how far they generalize to unseen architectures. For circuits of up to 16 qubits, the fine-tuned LLMs generate valid schedules on both training architectures, more often the fewer qubits a circuit has. In 12% of the compilations yielding a schedule, the best of ten runs needs up to 21% fewer operations than the heuristic baselines, after a rule-based post-processing step. A single run of one fine-tuned LLM produces a valid shuttling schedule for a previously unseen four-way branched architecture. This is preliminary evidence of cross-architecture generalization. On two other unseen architectures no LLM produces a valid schedule. Thus, LLM-learned shuttling compilation is feasible, and we show how far it currently reaches.
Current trapped-ion quantum computer architectures based on segmented traps utilize shuttling operations to establish connectivity between multiple sub-registers within one quantum processing unit. Complex trap architectures, including racetrack loops and junctions, offer prospects for increased scalability and have been successfully built and demonstrated. As hardware capabilities evolve, the need arises for additional automated software layers within the control stack for managing qubit routing. We present the automated generation of shuttling schedules for a branched ID architecture within a shuttling compiler that requires the integration of junctions. This not only provides the means for leveraging future new hardware advances, but also allows guiding the development of future architecture via resource estimation. Testing a wide range of quantum circuits, the junction-enabled shuttling compiler is able to reduce the necessary operations by a factor > 50 for translations and > 20 for separation/merge as compared to a linear architecture.
Trapped-ion quantum computers offer high-fidelity operations, long coherence times, and all-to-all connectivity within a single trap. However, scaling to large circuits is limited by the trap's ion capacity. The QCCD architecture addresses this by enabling ion shuttling across multiple traps, but excessive shuttling increases execution time and degrades fidelity. This paper presents an improved ion-shuttling approach targeting linear QCCD architectures. Building on a state-of-the-art approach [27] for linear trapped-ion devices, our approach introduces a front-layer-based scheduling method that dynamically prioritizes executable gates, along with a novel destination trap selection method for ion-shuttling, effectively reducing unnecessary ion movements. We also present a look-ahead gate selection strategy based on the gate dependency graph, avoiding the high runtime of the gate proximity approach used in the state-of-the-art approach, especially in circuits with all-to-all communication. Our approach achieves up to a 37.67% reduction in shuttle count and up to a 74.91% reduction in compilation time compared to the state-of-the-art approach for linear trapped-ion devices on actual NISQ benchmarks and synthetic circuits. On average, our approach achieves a 16.44% reduction in shuttle count and a 30.77% reduction in compilation time across all test cases. These improvements highlight the effectiveness of our approach, particularly for actual circuits.
An algorithm for the generation of shuttling sequences is necessary for the operation of a linear segmented ion-trap quantum computer. The present work provides an implementation of an algorithm that produces sequences proved to be optimal for circuits with a quantum Fourier transform-like structure. Such optimality was proved in previous work of our group. We first present an approach for qubit mapping, i.e. determining the initial ordering of the ions, termed the common ion order, and develop a heuristic algorithm for its implementation. We explain how this heuristic is integrated in the shuttling sequence generation algorithm described in the previous work. The results show the increased performance of the heuristic in terms of reducing the number of required shuttling operations. The number of ion displacements required exhibits a polynomial increase in terms of the number of qubits, such that these operations become the main contribution to the overall resource cost. Furthermore, we show that multiple zones for gate interactions can reduce the amount of qubit register reordering.
With the growth of quantum platforms for gate-based quantum computation, compilation holds a crucial role in deciding the success of the implementation. While there has been rich research in compilation techniques for the superconducting-qubit regime. The trapped-ion architectures, currently leading in robust quantum computations for their reliable operations, still lack competitive compilation strategies. This work introduces a unifying hardware abstraction, the “position graph”, representing various hardware architectures. With this abstraction, we model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures, enabling high-quality, scalable compilation methods. Specifically, we propose scheduling algorithms called SHuttling-Aware PERmutative (SHAPER) and SHuttling-AWare (SHAW) heuristic searches to tackle the complex constraints and dynamics of trapped-ion machines, with the cooperation of state-of-the-art permutation-aware mapping. These approaches generate executable circuits and native instructions that respect the physical constraints of shuttling-based architectures. We evaluate proposed algorithms across theorized and real architectures using the position graph framework. For completeness, we also introduce a linear program of trapped-ion scheduling that yields the optimal schedules, enabling a direct comparison with our heuristics. Our algorithm can successfully compile programs for extreme architectures where prior algorithms fail. When the baseline does complete, our produced schedules are 1.45 times faster on average, with best-case speedups up to 4 times faster.
Scalable trapped-ion quantum computers are expected to rely on two-dimensional grid architectures, in which ions are shuttled through a device with multiple junctions. These junctions are a known bottleneck and may become degraded, disabled, or otherwise unavailable, yet existing shuttling compilation approaches effectively assume an intact routing structure and do not address this failure mode. In this work, we introduce a robust shuttling compilation approach for trapped-ion QCCD architectures to close this gap. Our method extends existing shuttling compilation by a defect-tolerant path-based reconfiguration mechanism and combines it with prior cycle-based reconfiguration in a hybrid cycle-path strategy. This preserves efficiency when suitable cycles remain available while retaining functionality when junction failures disrupt the topology. We implement the approach in an open-source compiler and evaluate it under random and clustered defect patterns. The results show that the hybrid strategy preserves functionality in scenarios where cycle-only shuttling fails, while incurring only moderate overhead across different architecture scales, occupancies, and representative benchmark circuits. The evaluation furthermore provides a first systematic view of how increasing numbers of junction failures affect trapped-ion quantum computers.