一种新的多程序量子计算量子比特映射机制
A New Qubits Mapping Mechanism for Multi-programming Quantum Computing
摘要：
对于特定的量子芯片，多重编程有助于提高整体吞吐量和资源利用率。然而，先前用于将多个程序映射到量子芯片上的解决方案常常导致资源利用不足、高出错率和低保真度。在本文中，我们提出了一种新的方法来映射并发量子程序。我们的方法有三个关键组成部分。第一种是社区发现辅助划分（CDAP）算法，该算法综合考虑物理类型和出错率，为并发量子程序划分物理量子位，避免了健壮资源的浪费。第二个是X-SWAP方案，该方案允许程序间SWAP操作以减少SWAP开销。最后，我们提出了一个编译任务调度框架，该框架根据估计的保真度动态选择要执行的并发量子程序，从而提高量子计算机的吞吐量。我们评估了我们在公开可用的量子计算机IBMQ 16和模拟量子芯片IBMQ 20上的工作。我们的工作优于以前的解决方案，多编程的保真度和交换开销分别为12.0%和11.1%。
英文摘要：
For a specific quantum chip, multi-programming helps to improve overall throughput and resource utilization. However, the previous solutions for mapping multiple programs onto a quantum chip often lead to resource under-utilization, high error rate and low fidelity. In this paper, we propose a new approach to map concurrent quantum programs. Our approach has three critical components. The first one is the Community Detection Assisted Partition (CDAP) algorithm, which partitions physical qubits for concurrent quantum programs by considering both physical typology and the error rates, avoiding the waste of robust resources. The second one is the X-SWAP scheme that enables inter-program SWAP operations to reduce the SWAP overheads. Finally, we propose a compilation task scheduling framework, which dynamically selects concurrent quantum programs to be executed based on estimated fidelity, increasing the throughput of the quantum computer. We evaluate our work on publicly available quantum computer IBMQ16 and a simulated quantum chip IBMQ20. Our work outperforms the previous solution on multi-programming in both fidelity and SWAP overheads by 12.0% and 11.1%, respectively.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
