为了解决一些量子技术中二维量子线路量子位最近邻约束问题,提出了一种基于优先级的最近邻交互代价度量模型,并基于和谐搜索(HS)算法得到了量子位在二维体系结构中的最优布局,通过给出的局部排序方法来执行交换门的插入,最终使得量子线路在二维体系结构下实现最近邻交互。通过实验对所提出算法进行了验证,并与最新相关结果进行了比较。实验结果表明该方法与 文献报道的二维网格体系结构中的交换门数相比,平均降低了14.42%。

In order to solve the problem of two-dimensional quantum circuit qubit nearest neighbor constraint in some quantum techniques, a priority-based nearest neighbor interaction cost measurement model is proposed. The optimal layout of the qubit in two-dimensional architecture is obtained based on the harmony search (HS) algorithm and then the insertion of the SWAP gate is performed by the given local sorting method. Finally the quantum circuit realizes the nearest neighbor interaction under the two-dimensional architecture. The proposed algorithm is verified by experiments and compared with the latest related results. The experimental results show that the SWAP gates in proposed method is reduced by 14.42% on average compared with that in the two-dimensional grid architecture reported in the literatures.