Title: Scaling and assigning resources on ion trap QCCD architectures Show Chinese title

Title: 离子阱QCCD架构上的资源扩展与分配

Abstract: Ion trap technologies have earned significant attention as potential candidates for quantum information processing due to their long decoherence times and precise manipulation of individual qubits, distinguishing them from other candidates in the field of quantum technologies. However, scalability remains a challenge, as introducing additional qubits into a trap increases noise and heating effects, consequently decreasing operational fidelity. Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures have addressed this limitation by interconnecting multiple traps and employing ion shuttling mechanisms to transfer ions among traps. This new architectural design requires the development of novel compilation techniques for quantum algorithms, which efficiently allocate and route qubits, and schedule operations. The aim of a compiler is to minimize ion movements and, therefore, reduce the execution time of the circuit to achieve a higher fidelity. In this paper, we propose a novel approach for initial qubit placement, demonstrating enhancements of up to 50\% compared to prior methods. Furthermore, we conduct a scalability analysis on two distinct QCCD topologies: a 1D-linear array and a ring structure. Additionally, we evaluate the impact of the excess capacity -- i.e. the number of free spaces within a trap -- on the algorithm performance. Show Chinese abstract

Abstract: 离子阱技术因其较长的去相干时间和对单个量子比特的精确操控而受到广泛关注，被视为量子信息处理的潜在候选者，这使其区别于量子技术领域的其他候选者。 然而，可扩展性仍然是一个挑战，因为向陷阱中引入额外的量子比特会增加噪声和加热效应，从而降低操作保真度。 通过连接多个陷阱并采用离子穿梭机制在陷阱之间转移离子，被困离子量子电荷耦合器件（QCCD）架构解决了这一限制。 这种新的架构设计需要开发新型的量子算法编译技术，以高效分配和路由量子比特并调度操作。 编译器的目标是最小化离子移动，从而减少电路的执行时间以实现更高的保真度。 在本文中，我们提出了一种新的初始量子比特放置方法，与先前的方法相比，性能提升了高达50%。 此外，我们对两种不同的QCCD拓扑结构进行了可扩展性分析：一维线性阵列和环形结构。 另外，我们评估了过剩容量——即陷阱内的自由空间数量——对算法性能的影响。