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:2605.22463 · Physical Review Research

Reinforcement learning for ion shuttling on trapped-ion quantum computers

Maximilian Schier, Lea Richtmann, Christian Staufenbiel, Tobias Schmale, Daniel Borcherding, Michèle Heurs, Bodo Rosenhahn

quant-phcs.LGSubmitted May 21, 2026• Announced May 22, 2026• 0 citations
arXivHTMLPDF

Abstract

Scalable trapped-ion quantum computing is commonly realized with modular chips that feature distinct zones with specific functionalities, such as storage, state preparation, and gate execution. To execute a quantum circuit, the ions must be transported between these zones. This process is called ion shuttling. To achieve reliable computation results, the shuttling process must be optimized. However, as the number of ions increases, this becomes a high-dimensional optimization problem where optimal solutions cannot be computed efficiently. We demonstrate, to the best of our knowledge, the first use of reinforcement learning (RL) for the optimization of ion shuttling. RL is well-suited for such scenarios, as it enables learning a strategy through direct interaction with the problem. We show that our RL approach outperforms current state-of-the-art heuristic techniques, yielding a reduction in shuttling operations of up to 36.3 %. Furthermore, we show that our method is easily applicable to various chip architectures. Our approach offers a versatile method to study shuttling efficiency during chip design and, therefore, a highly relevant tool for future, more complex architectures.

Comments
15 pages + 9 pages supplementary material, 6 figures

Related papers

Shuttling for Trapped-Ion Quantum Computers with Embedded Processing Zones

Daniel Schoenberger, Janine Hilder, Ferdinand Schmidt‐Kaler +1 more

The Quantum Charge Coupled Device (QCCD) architecture is a promising pathway toward scalable quantum computation in trapped-ion quantum computers. Devices using this architecture rely on efficient ion shuttling between memory and processing zones to execute quantum circuits. Hardware for trapped-ion quantum computers with multiple different zones is already being developed, but without proper compilation support, there is a risk that we will not be able to use their full potential. Recent approaches to shuttling algorithms have primarily focused on small architectures or devices with a single processing zone. In this work, we propose to extend these algorithms to large grid-type systems with multiple processing zones embedded in the memory zone. For that, a two-step solution is described: first, partitioning quantum circuits to determine where each gate is executed, and second, adapting a publicly available shuttling algorithm for architectures with a single processing zone to handle the increased complexity of multi-zone systems. Empirical evaluations demonstrate the method's effectiveness across a range of grid-type architectures, showing that additional processing zones can significantly reduce quantum circuit execution time. With that, we provide a foundation for the compilation of shuttling-based trapped-ion quantum computers with multiple processing zones. An open-source implementation of the proposed approach is available at https://github.com/cda-tum/mqt-ion-shuttler.

IEEE International Conference on Quantum Software (QSW)•Jul 7, 2025•1 citation

Shuttling for Scalable Trapped-Ion Quantum Computers

Daniel Schoenberger, Stefan Hillmich, Matthias Brandl +1 more

Trapped-ion quantum computers exhibit promising potential to provide platforms for high-quality qubits and reliable quantum computation. The quantum charge coupled device (QCCD) architecture is a leading example that offers a modular solution to enable the realization of scalable quantum computers, paving the way for practical quantum algorithms with large qubit numbers. Within these devices, ions can be shuttled (moved) throughout the trap and through different dedicated zones, e.g., a memory zone for storage and a processing zone for the actual computation. However, due to decoherence of the ions’ quantum states, the qubits lose their quantum information over time. Thus, the required time steps of shuttling operations should be minimized. In this work,1 we propose a heuristic approach to determining an efficient shuttling schedule, which orchestrates the movement operations within the device. Given a quantum algorithm and a device architecture, the proposed approach produces shuttling schedules with a close-to-minimal amount of time steps for small-size QCCD architectures. For large-scale QCCD devices, empirical evaluations show promising results with respect to quality of the solution as well as performance. An implementation of the proposed approach is publicly available as part of the open-source Munich Quantum Toolkit (MQT) athttps://github.com/cda-tum/mqt-ion-shuttler.

arXiv:2402.14065•IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Dec 9, 2024•29 citations

Orchestrating Multi-Zone Shuttling in Trapped-Ion Quantum Computers

Daniel Schoenberger, Robert Wille

Trapped-ion quantum computers are a promising platform, offering high-quality qubits with long coherence times and high-fidelity gate operations. The Quantum Charge Coupled Device (QCCD) architecture provides a scalable blueprint by leveraging the ability to shuttle ions between distinct zones. However, realizing such architectures in practice requires software support to manage ion movement across multi-zone layouts. In this work, we propose a compilation strategy for QCCD architectures with multiple processing zones located outside a grid-type memory zone. Unlike previous approaches that treat processing zones as black-boxes, our method explicitly models their structural constraints, enabling optimized ion movement to and through them. It combines qubit partitioning with dependency-aware gate selection to reduce inter-zone shuttling while enabling simultaneous gate execution. We implemented the method in an open-source tool and empirically demonstrated its effectiveness across several QCCD layouts, laying a foundation for the compilation of multi-zone trapped-ion systems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

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•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

An Efficient Heuristic Approach for Ion Shuttle Scheduling via Multi-Agent Path Planning

Jion Tamamoto, Yuto Matuda, Daniel Schoenberger +2 more

Trapped-ion quantum computers are gaining attention as a promising platform for achieving reliable quantum computation using high-quality qubits. Among them, the Quantum Charge-Coupled Device (QCCD) architecture is recognized as a modular solution for constructing scalable quantum computers with a large number of qubits, significantly enhancing the feasibility of executing practical quantum algorithms. In the QCCD architecture, ions shuttle between different dedicated zones, such as memory zones and processing zones, enabling efficient quantum computation.In this paper, we propose an efficient heuristic approach using Multi-Agent Path Planning (MAPP) to generate an efficient shuttling schedule that optimizes ion movement within the device. The evaluation results show that the numbers of time steps can be improved to only 88.61% for Full-Resister-Access (FRA), 91.46% for Quantum Fourier Transform (QFT) and 88.87% for Random Register Access (RRA) on average compared to a state-of-the art method. In particular, when comparing only the additional time steps spent solely on shuttling the proposed algorithm requires only 76.83% of those required by the existing method for FRA, 35.26% for QFT, and 37.47% for RRA on average.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 19, 2026•0 citations
Scalable trapped-ion quantum computing is commonly realized with modular chips that feature distinct zones with specific functionalities, such as storage, state preparation, and gate execution. To execute a quantum circuit, the ions must be transported between these zones. This process is called ion shuttling. To achieve reliable computation results, the shuttling process must be optimized. However, as the number of ions increases, this becomes a high-dimensional optimization problem where optimal solutions cannot be computed efficiently. We demonstrate, to the best of our knowledge, the first use of reinforcement learning (RL) for the optimization of ion shuttling. RL is well-suited for such scenarios, as it enables learning a strategy through direct interaction with the problem. We show that our RL approach outperforms current state-of-the-art heuristic techniques, yielding a reduction in shuttling operations of up to 36.3 %. Furthermore, we show that our method is easily applicable to various chip architectures. Our approach offers a versatile method to study shuttling efficiency during chip design and, therefore, a highly relevant tool for future, more complex architectures.
The Quantum Charge Coupled Device (QCCD) architecture is a promising pathway toward scalable quantum computation in trapped-ion quantum computers. Devices using this architecture rely on efficient ion shuttling between memory and processing zones to execute quantum circuits. Hardware for trapped-ion quantum computers with multiple different zones is already being developed, but without proper compilation support, there is a risk that we will not be able to use their full potential. Recent approaches to shuttling algorithms have primarily focused on small architectures or devices with a single processing zone. In this work, we propose to extend these algorithms to large grid-type systems with multiple processing zones embedded in the memory zone. For that, a two-step solution is described: first, partitioning quantum circuits to determine where each gate is executed, and second, adapting a publicly available shuttling algorithm for architectures with a single processing zone to handle the increased complexity of multi-zone systems. Empirical evaluations demonstrate the method's effectiveness across a range of grid-type architectures, showing that additional processing zones can significantly reduce quantum circuit execution time. With that, we provide a foundation for the compilation of shuttling-based trapped-ion quantum computers with multiple processing zones. An open-source implementation of the proposed approach is available at https://github.com/cda-tum/mqt-ion-shuttler.
Trapped-ion quantum computers exhibit promising potential to provide platforms for high-quality qubits and reliable quantum computation. The quantum charge coupled device (QCCD) architecture is a leading example that offers a modular solution to enable the realization of scalable quantum computers, paving the way for practical quantum algorithms with large qubit numbers. Within these devices, ions can be shuttled (moved) throughout the trap and through different dedicated zones, e.g., a memory zone for storage and a processing zone for the actual computation. However, due to decoherence of the ions’ quantum states, the qubits lose their quantum information over time. Thus, the required time steps of shuttling operations should be minimized. In this work,1 we propose a heuristic approach to determining an efficient shuttling schedule, which orchestrates the movement operations within the device. Given a quantum algorithm and a device architecture, the proposed approach produces shuttling schedules with a close-to-minimal amount of time steps for small-size QCCD architectures. For large-scale QCCD devices, empirical evaluations show promising results with respect to quality of the solution as well as performance. An implementation of the proposed approach is publicly available as part of the open-source Munich Quantum Toolkit (MQT) athttps://github.com/cda-tum/mqt-ion-shuttler.
Trapped-ion quantum computers are a promising platform, offering high-quality qubits with long coherence times and high-fidelity gate operations. The Quantum Charge Coupled Device (QCCD) architecture provides a scalable blueprint by leveraging the ability to shuttle ions between distinct zones. However, realizing such architectures in practice requires software support to manage ion movement across multi-zone layouts. In this work, we propose a compilation strategy for QCCD architectures with multiple processing zones located outside a grid-type memory zone. Unlike previous approaches that treat processing zones as black-boxes, our method explicitly models their structural constraints, enabling optimized ion movement to and through them. It combines qubit partitioning with dependency-aware gate selection to reduce inter-zone shuttling while enabling simultaneous gate execution. We implemented the method in an open-source tool and empirically demonstrated its effectiveness across several QCCD layouts, laying a foundation for the compilation of multi-zone trapped-ion systems.
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.
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.
Trapped-ion quantum computers are gaining attention as a promising platform for achieving reliable quantum computation using high-quality qubits. Among them, the Quantum Charge-Coupled Device (QCCD) architecture is recognized as a modular solution for constructing scalable quantum computers with a large number of qubits, significantly enhancing the feasibility of executing practical quantum algorithms. In the QCCD architecture, ions shuttle between different dedicated zones, such as memory zones and processing zones, enabling efficient quantum computation.In this paper, we propose an efficient heuristic approach using Multi-Agent Path Planning (MAPP) to generate an efficient shuttling schedule that optimizes ion movement within the device. The evaluation results show that the numbers of time steps can be improved to only 88.61% for Full-Resister-Access (FRA), 91.46% for Quantum Fourier Transform (QFT) and 88.87% for Random Register Access (RRA) on average compared to a state-of-the art method. In particular, when comparing only the additional time steps spent solely on shuttling the proposed algorithm requires only 76.83% of those required by the existing method for FRA, 35.26% for QFT, and 37.47% for RRA on average.