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

Quantum Information Processing

Automating quantum experiment control: From circuit compilation to ion routing

Kelly E. Stevens, Jason Amini, S. Charles Doret, Greg Mohler, Curtis Volin, Alexa W. Harter

Published Jan 21, 2017• 5 citations
Publisher
DOI
10.1007/s11128-016-1454-1

Related papers

Automated Reasoning in Quantum Circuit Compilation

Dimitrios Thanos, Alejandro Villoria, Sebastiaan Brand +4 more

Lecture notes in computer science•Oct 12, 2024•7 citations

Quantum Circuit Compilation: An Emerging Application for Automated Reasoning

Davide Venturelli, N. Minh, Bryan O’Gorman +6 more

•Apr 11, 2019•30 citations

Automating the Comparison of Quantum Compilers for Quantum Circuits

Marie Salm, Johanna Barzen, Frank Leymann +2 more

Communications in computer and information science•Jan 1, 2021•34 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

Evaluation Data to "From QCCD Trapped-Ion Hardware to Quantum Compilers: Capabilities, Architectures, and Compilation"

L. Schmid, Josef Eisinger, Daniel Schönberger +5 more

Data and plotting scripts for the case studies in “From QCCD Trapped-Ion Hardware to Quantum Compilers: Capabilities, Architectures, and Compilation”. Two circuits, randomly generated interaction layers and a logical teleportation circuit on the [[7,1,3]] Steane code, were compiled onto a 1D linear segmented register and onto a 2D grid with processing zones outside the memory region. The archive holds the resulting routing costs as CSV, the teleportation circuit as OpenQASM 2.0, and the scripts that draw the paper’s two case-study figures from them. uv run scripts/plot_scaling.py and uv run scripts/plot_teleportation.py regenerate both figures.

•Oct 20, 2026•1 citation

Basic circuit compilation techniques for an ion-trap quantum machine

Dmitri A Maslov

We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are structured so as to best assist with the overall optimization while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, and optimizing classical control sequences. Our approach allows a trade-off between circuit runtime and quantum error, as well as to accommodate future changes in the optimization criteria that may likely arise as a result of the anticipated improvements in the physical-level control of the experiment.

arXiv:1603.07678•New Journal of Physics•Feb 3, 2017•123 citations
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.
Data and plotting scripts for the case studies in “From QCCD Trapped-Ion Hardware to Quantum Compilers: Capabilities, Architectures, and Compilation”. Two circuits, randomly generated interaction layers and a logical teleportation circuit on the [[7,1,3]] Steane code, were compiled onto a 1D linear segmented register and onto a 2D grid with processing zones outside the memory region. The archive holds the resulting routing costs as CSV, the teleportation circuit as OpenQASM 2.0, and the scripts that draw the paper’s two case-study figures from them. uv run scripts/plot_scaling.py and uv run scripts/plot_teleportation.py regenerate both figures.
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are structured so as to best assist with the overall optimization while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, and optimizing classical control sequences. Our approach allows a trade-off between circuit runtime and quantum error, as well as to accommodate future changes in the optimization criteria that may likely arise as a result of the anticipated improvements in the physical-level control of the experiment.