Automatic Shuttling Sequence Generation for a Linear Ion Trap Computer

With the development of quantum computers, the need to automate complex tasks becomes necessary. One such task is moving ions in a shuttling-based ion trap quantum computer (ITQC). quantum circuits. This automation is achieved via a custom-built compiler that incorporates the algorithm.

We discuss the architecture of the linear segmented ITQC, associated constraints, and the We present an algorithm to automate the generation of shuttling sequences from the description of complexity of shuttling ions. We present our algorithm and we propose a metric, the circuit fit, which measures how well a shuttling sequence is adapted to a circuit considering the costliest operations on a given computer architecture. We then test our shuttling sequence generation algorithm on two of the most used quantum circuits: the N-Toffoli gate and the quantum Fourier transform (QFT).

We provide a mathematical proof that for QFT-like circuit there exists an optimal shuttling sequence. This proof and the circuit fit metric provide for a better understanding of the shuttling of ions and how to optimize shuttling sequences. Finally, we show that our algorithm generates an optimal shuttling sequence for QFT circuits.