A Fast and Scalable Qubit-Mapping Method for NoisyIntermediate-Scale Quantum Computers
TimeTuesday, July 12th11:15am - 11:37am PDT
Location3005, Level 3
Event Type
Research Manuscript
Quantum Computing
DescriptionThis paper presents an efficient qubit-mapping method that redesigns a quantum circuit to overcome the limitations of qubit connectivity. We propose a graph-isomorphism search to generate the scalable initial mapping. In the main mapping procedure, we use an adaptive look-ahead search to resolve the connectivity constraint within a short runtime. Compared with the state-of-the-art method [16], our proposed method reduced additional gate counts by 23 % on average, and runtime by 68 % for the three largest benchmark circuits. It also has 3 % lower circuit overhead on average, and compiles the circuit 100 times faster than the method [18].