https://doi.org/10.1140/epjqt/s40507-025-00320-x
Research
A scalable routing method for superconducting quantum processor
1
Laboratory for Advanced Computing and Intelligence Engineering, Information Engineering University, 450001, Zhengzhou, Henan, China
2
Songshan Laboratory, 450008, Zhengzhou, Henan, China
3
School of Cyber Science and Engineering, Zhengzhou University, 450002, Zhengzhou, Henan, China
a
wangwl19888@163.com
b
shanzhengzz@163.com
Received:
26
July
2024
Accepted:
27
January
2025
Published online:
10
February
2025
Routing design is an important aspect in aiding the completion of the Quantum Processing Unit (QPU) layout design for large-scale superconducting quantum processors. One of the research focuses is how to generate reliable routing schemes within a short time. In this study, we propose a superconducting quantum processor auto-routing method for supporting scalable architecture, which is mainly implemented through the bidirectional A star algorithm, the backtracking algorithm, and the greedy strategy. By using this method, the number of crossovers and corners can be reduced while efficiently completing the processor routing. To verify the effectiveness of our method, we selected 5 types of qubit numbers for processor routing experiments. The experimental results show that compared to the improved A star algorithm of Qiskit Metal, our method reduces the average execution time by at least 43.61% and 41.68% in serial and parallel, respectively. Compared with four other routing algorithms, our method has a minimum average reduction of 10.63% and 1.21% in the number of crossovers and corners, respectively. In addition, our method supports the processor routing design of planar and flip-chip architectures, and can automatically process both airbridge and insulation types of crossovers. Therefore, our method can provide efficient and reliable automated routing design to assist the development of large-scale superconducting quantum processors.
Key words: Superconducting quantum processor / Routing design / Bidirectional A star algorithm / Automation
Supplementary Information The online version contains supplementary material available at https://doi.org/10.1140/epjqt/s40507-025-00320-x.
© The Author(s) 2025
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
