Shuttling in Bidimensional Segmented Ion-Trap Quantum Processors with T-Junctions
This paper compares the efficiency of 1D and 2D quantum processor architectures.
This paper introduces a new method for comparing the efficiency of 1D and 2D quantum processor architectures.
Before reading this…
Applications
- →Quantum computing
- →Quantum processor design
To understand this paper, make sure you know these concepts first:
- Quantum computing basicsfind papers →
- Quantum processor architecturesfind papers →
Abstract
More Like ThisShuttle-based trapped ion quantum processors typically employ a one-dimensional (1D) linear architecture to transport ion-qubits between one ore more laser interaction zones where the quantum gates are implemented, along with several qubit register storage segments. The two-dimensional (2D) quantum CCD architecture employs also T- or X-junctions for an improved scaling and efficiency. Here, we explore the shuttling layer in the compilation of quantum algorithm typical building blocks in such architecture. To weight the effort of linear shuttle and junction shuttle, we introduce individual cost functions for each operation. This allows comparing the total cost for quantum circuit building blocks such as the QFT, Carry, Adder, Shift, and Comparator circuits. We study their scaling properties with increased qubit numbers. At equivalent transport cost for junction and linear shuttling, we show that 2D architectures outperform the 1D linear trap with the ratio improving as the number of ions increases. Finally, we discuss the use of cells, such that the entire processor is constructed from a 2D array of such interconnected cells. The work aims to optimize quantum processor architectures, implementing a co-design that fits to the specific task and scaling up in a shuttle-efficient way.