| 引用本文: | 朱鹏程,卫丽华,冯世光,周祥臻,郑盛根,管致锦.面向分布式超导量子计算架构的量子线路映射.软件学报,2025,36(5):2381-2400 |
| |
|
| |
|
|
| 本文已被：浏览 1214次 下载 2715次 |
码上扫一扫！ |
|
|
| 面向分布式超导量子计算架构的量子线路映射 |
|
朱鹏程1,2, 卫丽华1,2, 冯世光2, 周祥臻3, 郑盛根4, 管致锦2
|
|
1.宿迁学院 信息工程学院, 江苏 宿迁 223800;2.南通大学 信息科学技术学院, 江苏 南通 226019;3.清华大学 计算机科学与技术系, 北京 100084;4.鹏城实验室, 广东 深圳 518055
|
|
| 摘要: |
| 近年来, 超导量子互连技术的研究取得了重要进展, 这为构建分布式超导量子计算架构提供了有效途径. 分布式超导架构在网络拓扑、量子比特连通性、以及量子态传输协议等方面对量子线路的执行施加了严格约束. 为在分布式架构上调度和执行量子线路, 需要通过专门的映射工序对量子线路进行适配底层架构的变换, 并将变换后的线路交由网络中多个QPU (quantum processing unit)协同运行. 分布式量子线路映射需向原始线路插入辅助的量子态移动操作, 这些操作(尤其是QPU间量子态移动操作)具有较高的错误率. 因此, 减少映射所需的量子态移动操作数对于保证分布式计算的成功率至关重要. 基于超导量子互连技术和超导QPU的技术特征构建一种抽象的分布式量子计算模型, 并基于该抽象模型提出一种分布式量子线路映射方法, 该方法由量子比特分布式映射和量子态路由两个核心模块组成, 前者以量子态路由开销为代价函数, 通过局部寻优和模拟退火相结合的策略生成近最优的初始映射; 后者根据量子门执行的不同情形构建多个启发式量子态路由策略, 并通过灵活应用这些策略最小化插入的量子态移动操作数. 所构建的分布式抽象模型屏蔽了底层架构中和量子线路映射无关的物理细节, 这使得基于该模型的映射方法可适用于一类分布式超导架构而非某个特定架构. 另外, 所提方法可作为辅助工具参与分布式网络拓扑结构的设计和评价. 实验结果表明, 所提算法可以有效降低映射所需的QPU内量子态移动操作(即SWAP门)数和QPU间量子态移动操作(即ST门)数. 相较已有算法, 在所有基准线路上平均减少69.69%的SWAP门和85.88%的ST门, 且时间开销和已有算法接近. |
| 关键词: 超导量子计算 量子网络 分布式计算 量子处理器 量子线路映射 |
| DOI：10.13328/j.cnki.jos.007167 |
| 分类号:TP303 |
| 基金项目:国家自然科学基金(62072259); 江苏省自然科学基金(BK20221411); 宿迁市科技计划面上项目(H202117) |
|
| Quantum Circuit Mapping for Distributed Superconducting Quantum Computing Architecture |
|
ZHU Peng-Cheng1,2, WEI Li-Hua1,2, FENG Shi-Guang2, ZHOU Xiang-Zhen3, ZHENG Sheng-Gen4, GUAN Zhi-Jin2
|
|
1.College of Information Engineering, Suqian University, Suqian 223800, China;2.School of Information Science and Technology, Nantong University, Nantong 226019, China;3.Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;4.Peng Cheng Laboratory, Shenzhen 518055, China
|
| Abstract: |
| In recent years, research on the interconnect technology of superconducting qubits has made important progress, providing an effective way to build a distributed computing architecture for superconducting quantum computers. The distributed superconducting architecture imposes strict constraints on the execution of quantum circuits in terms of network topology, qubit connectivity, and quantum state transfer protocols. To execute and schedule quantum circuits on a distributed architecture, the circuit mapping process is required to transform the quantum circuits to adapt to the underlying architecture and then to distribute the transformed circuits to multiple QPUs. The distributed circuit mapping process necessitates the insertion of additional quantum operations into the original circuit. Such operations, especially the inter-QPU state transfer operations, are susceptible to noise, leading to high error rates. Therefore, minimizing the number of such additional operations inserted by the mapping process is critical to improving the overall computation success rate. This study constructs an abstract model of distributed quantum computing based on the technical features of the interconnect technology of superconducting qubits and today’s superconducting QPUs. Moreover, this study proposes a distributed quantum circuit mapping approach based on this abstract model. The proposed approach consists of two main components the distributed qubit mapping algorithm and the qubit state routing algorithm. The former formulates the problem of distributing qubits to different QPUs as a combinatorial optimization problem and employs simulated annealing enhanced with local search to find the initial mapping that brings the optimal total routing cost. The latter constructs several heuristic qubit routing rules for different scenarios and integrates them systematically to minimize the additional operations inserted by the mapping process. The abstract model shields any technical details of the underlying architecture that are irrelevant to circuit mapping, which makes the mapping method applicable to a class of such networks rather than a specific one. Moreover, the approach proposed in this study can be used as an ancillary tool to design and evaluate the network topology of distributed systems. The experimental results show that, compared to the baseline approach, the proposed approach reduces the number of intra-chip operations (SWAP gates) and inter-chip operations (ST gates) by 69.69% and 85.88% on average, respectively, with a time overhead similar to existing algorithms. |
| Key words: superconducting quantum computing quantum network distributed computing quantum processing unit (QPU) quantum circuit mapping |
|
|
|
|
