论文标题
基于子图同构和过滤深度限制搜索的量子映射
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
论文作者
论文摘要
将逻辑量子电路映射到嘈杂的中间规模量子（NISQ）设备是一个具有挑战性的问题，它吸引了量子和古典计算社区的迅速增长的兴趣。本文通过（i）选择一个初始映射来考虑一个有效的方法，该方法考虑给定NISQ设备的体系结构图与输入逻辑电路诱导的图之间的相似性； （ii）以过滤和深度限制的方式进行搜索，是一种最有用的交换组合，使逻辑电路中的两倍大门可执行。所提出的电路转换算法可以显着减少所需的辅助双Quition门的数量，尤其是当它具有大量的两个Quibent门时。对于131台电路和IBM当前的高级Q系统的广泛基准，即IBM Q Nokyo，我们的算法需求平均为0.4346个，每个输入两Qubit Gate的额外的两倍大门额外的两倍大门，而三个省级算法的相应数字为0.6047，0.8147，1.8154，和1.8154，和1.8154，和1.8154，和1.8154，和10067。
Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This paper proposes an efficient method by (i) selecting an initial mapping that takes into consideration the similarity between the architecture graph of the given NISQ device and a graph induced by the input logical circuit; and (ii) searching, in a filtered and depth-limited way, a most useful SWAP combination that makes executable as many as possible two-qubit gates in the logical circuit. The proposed circuit transformation algorithm can significantly decrease the number of auxiliary two-qubit gates required to be added to the logical circuit, especially when it has a large number of two-qubit gates. For an extensive benchmark set of 131 circuits and IBM's current premium Q system, viz., IBM Q Tokyo, our algorithm needs, in average, 0.4346 extra two-qubit gates per input two-qubit gate, while the corresponding figures for three state-of-the-art algorithms are 0.6047, 0.8154, and 1.0067 respectively.
