量子近似优化算法在数字分区问题中的应用  

Application of quantum approximate optimization algorithm in number partition problem

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

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

出　　处：《量子电子学报》2024年第2期367-377,共11页Chinese Journal of Quantum Electronics

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

摘　　要：量子近似优化算法(QAOA)是一种近似求解组合优化问题的方法,它通过反复调整电路参数,以获取问题哈密顿量的最大期望值为目的来解决问题,在组合优化问题领域具有广阔的应用前景。将QAOA应用于数字分区问题(二分区问题),通过将问题函数转换成对应的哈密顿量,构造了量子线路,采用线性近似约束优化(COBYLA)方法对电路参数进行了优化,并使用IBMQ模拟平台进行了模拟实验。研究发现量子近似优化算法在数字分区问题中有着良好的性能表现,可在多项式时间内给出问题的解,并且降低了问题的时间复杂度。Quantum approximate optimization algorithm(QAOA)is a method for approximately solving combinatorial optimization problems,and has broad application prospects in related fields.It solves problems by repeatedly adjusting circuit parameters in order to maximize the expected value of Hamiltonian.In the research,QAOA is applied to the number partition problem(two partition problem).By converting the problem function into the corresponding Hamiltonian,a quantum circuit is constructed.The circuit parameters are optimized using constrained optimization by linear approximation(COBYLA)method,and the simulation experiment is carried out on IBMQ simulation platform.It is found that QAOA has good performance in number partition problems,which can obtain the solutions of the problems in polynomial time and reduce the time complexity of the problems.

关 键 词：量子计算 量子线路 数字分区 量子近似优化算法 

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