Mainz 2026 – scientific programme
Parts | Days | Selection | Search | Updates | Downloads | Help
Q: Fachverband Quantenoptik und Photonik
Q 74: Quantum Information – Concepts and Methods
Q 74.1: Talk
Friday, March 6, 2026, 11:00–11:15, P 10
Computational Capabilities and Compilation Strategies for Trapped-Ion Quantum Computers — •Jurek Eisinger1, Ludwig Schmid2, Daniel Schönberger2, Janine Hilder1, 3, Christian Marciniak3, Ulrich Poschinger1, Ferdinand Schmidt-Kaler1, and Robert Wille2 — 1QUANTUM, University of Mainz, Department of Physics, Staudingerweg 7, Germany — 2Chair for Design Automation, Technical University of Munich, Germany — 3neQxt, 63906 Erlenbach am Main, Germany
Trapped-ion quantum computers mature to larger qubit numbers, but their computational capability is limited by architectural and control constraints. We present a framework for quantifying and optimizing the computational capabilities of trapped-ion processors. Using compiler techniques from classical computer science, we show how arbitrary quantum circuits can be mapped to hardware-efficient sequences of operations, optimized for metrics such as shuttling distance and gate overhead. The approach is demonstrated for both 1D and 2D [Schoenberger et al., Proc. IEEE QSW (2025), DOI: 10.1109/QSW67625.2025.00023] shuttling architectures, and extended toward logical qubit encodings to support fault-tolerant operations in future large-scale systems. In this context, we introduce a universal routing and scheduling algorithm for a shuttling-based trapped-ion quantum computer that efficiently orchestrates qubit register reconfiguration, and gate execution, tailored to varying levels of ion-qubit connectivity.
Keywords: Trapped-Ion Quantum Computing; Compilation for Quantum Computers; Shuttling Optimization