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

TL;DR

This paper presents a heuristic algorithm for optimizing shuttling sequences in linear segmented ion-trap quantum computers, significantly reducing the number of ion displacements needed for circuits with Fourier transform-like structures.

Contribution

It introduces a heuristic for qubit mapping integrated into an existing sequence generation algorithm, improving efficiency in ion shuttling operations.

Findings

Heuristic reduces the number of shuttling operations.

Ion displacements grow polynomially with qubit number.

Multiple zones decrease qubit reordering requirements.

Abstract

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.