论文标题
通过双源最佳路由在大量子电路上通过双源最佳路由的稳健量子映射算法
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
论文作者
论文摘要
Qubit映射是在真实硬件设备上实现量子电路的关键方面。当前，在处理涉及数百个量子位的较大电路尺寸时，现有的量子映射算法会遇到困难。在本文中，我们介绍了一种创新的Qubit映射算法，Duostra量身定制，以应对在连接有限的真实硬件设备上实施大型量子电路的挑战。 Duostra通过有效地确定双度门的最佳路径并相应地插入交换门以实现在真实设备上的双倍操作。连同两种启发式调度算法，有限的（LE）搜索和最短路径（SP）估计，它在合理的运行时产生了良好质量的结果，从而努力实现量子优势。实验结果展示了我们算法的优势，尤其是对于NISQ时代以外的大型电路。例如，在具有超过50个QUAT的大型电路上，我们可以在QMAP，T | KET>，Qiskit和Saber中的虚拟最佳结果中平均降低映射成本21.75％。此外，与QMAP，TOQM，TOQM，T | KET>，QSISKIT和SABER相比，对于Sabre-Large基准等中型电路，我们将映射成本提高了4.5％，5.2％，16.3％，20.7％和25.7％。
Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when dealing with larger circuit sizes involving hundreds of qubits. In this paper, we introduce an innovative qubit mapping algorithm, Duostra, tailored to address the challenge of implementing large-scale quantum circuits on real hardware devices with limited connectivity. Duostra operates by efficiently determining optimal paths for double-qubit gates and inserting SWAP gates accordingly to implement the double-qubit operations on real devices. Together with two heuristic scheduling algorithms, the Limitedly-Exhausitive (LE) Search and the Shortest-Path (SP) Estimation, it yields results of good quality within a reasonable runtime, thereby striving toward achieving quantum advantage. Experimental results showcase our algorithm's superiority, especially for large circuits beyond the NISQ era. For example, on large circuits with more than 50 qubits, we can reduce the mapping cost on an average 21.75% over the virtual best results among QMAP, t|ket>, Qiskit and SABRE. Besides, for mid-size circuits such as the SABRE-large benchmark, we improve the mapping costs by 4.5%, 5.2%, 16.3%, 20.7%, and 25.7%, when compared to QMAP, TOQM, t|ket>, Qiskit, and SABRE, respectively.
