Grover量子搜索算法的线路优化  

Circuit optimization of Grover quantum search algorithm

作　　者：吴希 李志强[1] 杨东晗 WU Xi;LI Zhi-qiang;YANG Dong-han(College of Information Engineering,Yangzhou University,Yangzhou 225000,China)

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

出　　处：《计算机工程与科学》2023年第3期420-425,共6页Computer Engineering & Science

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

摘　　要：Grover算法是能够高效查找到目标态的量子搜索算法,但随着搜索数据量的增大,它的量子线路面临着复杂的门分解问题。在如今的NISQ时代资源非常有限,因此线路的深度成为一种重要的度量标准。介绍了一种基于分治思想的二阶段量子搜索算法,能够在量子计算机上快速地并行运行。提出一种线路优化方法,应用块级的Oracle线路来减少迭代次数。将该方法与分治思想相结合,提出2P-Grover算法。在量子计算框架Cirq上进行模拟实验,与Grover算法进行对比。实验结果表明,2P-Grover算法能够使线路的深度至少减少60%,并且保持了较高的搜索成功率。Grover algorithm is a quantum search algorithm that can find the target state efficiently.However,with the increase of the amount of searching data,Grover’s quantum circuit is faced with the complex gate decomposition problem.In today’s NISQ era,resources are very limited,so circuit depth is an important metric.This paper introduces a two-stage quantum search algorithm based on divide-and-conquer,which can run quickly in parallel on a quantum computer.A circuit optimization method is proposed to reduce the number of iterations by using block-level oracle circuit.Combining this method with divide-and-conquer idea,it is defined as 2P-Grover algorithm.The simulation experiment was carried out on the quantum computing framework Cirq.The experimental results show that,compared with Grover algorithm,the 2P-Grover algorithm can reduce the circuit depth by at least 1.2 times and maintain a high probability of search success.

关 键 词：量子线路 GROVER算法 量子部分搜索算法 量子信息 Cirq框架 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]