论文标题
线性分段离子陷阱量子计算机的自动生成的穿梭序列
Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer
论文作者
论文摘要
扩展陷阱的量子计算机平台的一种有希望的方法是将多个捕获的离子量子置量集（'离子晶体'）存储在分段的微芯片陷阱中，并通过离子的物理运动（'shuttling'）互连。为了实现适度复杂性的量子电路，合适的值分配和穿梭时间表的设计需要自动化。在这里，我们描述和测试算法，这些算法准确地解决了这些任务。我们描述了用于全自动生成穿梭时间表的算法，符合给定陷阱结构施加的约束。此外，我们介绍了不同的初始量子分配方法，并将其用于随机电路（最多20 QUAT）和类似量子傅立叶变换的电路，以及最多40 QUBITS的通用Toffoli门。我们发现，对于包含固定结构的量子电路，高级分配算法可以用来减少开销的开销。
A promising approach for scaling-up trapped-ion quantum computer platforms is by storing multiple trapped-ion qubit sets ('ion crystals') in segmented microchip traps and to interconnect these via physical movement of the ions ('shuttling'). Already for realizing quantum circuits with moderate complexity, the design of suitable qubit assignments and shuttling schedules require automation. Here, we describe and test algorithms which address exactly these tasks. We describe an algorithm for fully automated generation of shuttling schedules, complying to constraints imposed by a given trap structure. Furthermore, we introduce different methods for initial qubit assignment and compare these for random circuit (of up to 20 qubits) and quantum Fourier transform-like circuits, and generalized Toffoli gates of up to 40 qubits each. We find that for quantum circuits which contain a fixed structure, advanced assignment algorithms can serve to reduce the shuttling overhead.
