A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computers
- Title
- A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computers
- Authors
- 박성혜; 김대연; 권민혁; 심재윤; 강석형
- Date Issued
- 2022-07-10
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Abstract
- This paper presents an efficient qubit-mapping method that redesigns a quantum circuit to overcome the limitations of qubit connectivity. We propose a recursive graph-isomorphism search to generate the scalable initial mapping. In the main mapping, we use an adaptive look-ahead window search to resolve the connectivity constraint within a short runtime. Compared with the state-of-the-art method [15], our proposed method reduced the number of additional gates by 23% on average and the runtime by 68% for the three largest benchmark circuits. Furthermore, our method improved circuit stability by reducing the circuit depth and thus can be a step forward towards fault tolerance.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/116966
- Article Type
- Conference
- Citation
- 59th ACM/IEEE Design Automation Conference, DAC 2022, page. 13 - 18, 2022-07-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.