基于最小权和模板匹配的Oracle线路优化  

Optimization of Oracle circuits based on minimum weight and template matching

作　　者：杨冬晗 李志强[1] 吴希 潘文杰 杨辉[1] YANG Donghan;LI Zhiqiang;WU Xi;PAN Wenjie;YANG Hui(College of Information Engineering,Yangzhou University,Yangzhou 225100,China)

机构地区：[1]扬州大学信息工程学院,江苏扬州225100

出　　处：《量子电子学报》2024年第1期151-160,共10页Chinese Journal of Quantum Electronics

基　　金：国家自然科学基金(62071240);江苏省高校基金(10KJB520021)。

摘　　要：优化量子线路对于提高量子算法的计算效率和降低资源成本至关重要,特别是在布尔函数构建的Oracle线路中。该优化过程分为两个关键阶段,第一个阶段基于最小权匹配算法对Oracle线路相同受控点的MCT门进行重排序,最小化生成线路的门数;第二个阶段利用模板匹配的方式进一步降低线路的门数和代价。实验结果表明,相较于优化工具RCViewer^(+),在4~10位量子比特数下, Deutsch-Jozsa算法下的Oracle线路门数降低了约48.3%,代价减少了约64.5%;Grover算法下的Oracle线路门数降低了约25.0%,代价减少了约18.2%。Optimizing quantum lines is essential to improve the computational efficiency and reduce the resource cost of quantum algorithms,especially in the case of Oracle circuit constructed from Boolean functions.This optimization process is divided into two key stages.In the first stage,the MCT gates of the same controlled points of Oracle circuits are reordered based on the minimum weight matching algorithm to minimize the number of gates for generating circuits.In the second stage,the method of template matching is utilized to further reduce the number of gates and the cost of the circuits.The experimental results show that,compared with the optimization tool of RCViewer^(+),for 4-10 qubits,the number of Oracle circuit gates can be reduced by about 48.3%,and the cost can be reduced by about 64.5%using Deutsch-Jozsa algorithm,while the number of Oracle circuit gates is reduced by about 25.0%,and the cost is reduced by about 18.2%using Grover algorithm.

关 键 词：量子信息 量子线路 Oracle线路优化 最小权匹配 模板匹配 

分 类 号：O431.2[机械工程—光学工程]