QAOA 收敛性的基本证明

IF 2.8 2区物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY

New Journal of Physics Pub Date : 2024-06-30 DOI:10.1088/1367-2630/ad59bb

Lennart Binkowski, Gereon Koßmann, Timo Ziegler and René Schwonnek

{"title":"QAOA 收敛性的基本证明","authors":"Lennart Binkowski, Gereon Koßmann, Timo Ziegler and René Schwonnek","doi":"10.1088/1367-2630/ad59bb","DOIUrl":null,"url":null,"abstract":"The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof involves retracing the connection between the quantum adiabatic algorithm and the QAOA, and naturally suggests a refined definition of the ‘phase separator’ and ‘mixer’ keywords.","PeriodicalId":19181,"journal":{"name":"New Journal of Physics","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Elementary proof of QAOA convergence\",\"authors\":\"Lennart Binkowski, Gereon Koßmann, Timo Ziegler and René Schwonnek\",\"doi\":\"10.1088/1367-2630/ad59bb\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof involves retracing the connection between the quantum adiabatic algorithm and the QAOA, and naturally suggests a refined definition of the ‘phase separator’ and ‘mixer’ keywords.\",\"PeriodicalId\":19181,\"journal\":{\"name\":\"New Journal of Physics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"New Journal of Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1088/1367-2630/ad59bb\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Journal of Physics","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1088/1367-2630/ad59bb","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

量子交替算子解析（QAOA）及其前身量子近似优化算法是解决组合优化问题最广泛使用的量子算法之一。然而，由于 QAOA 还没有严格的收敛性证明，我们在本文中提供了一个证明。该证明涉及追溯量子绝热算法与 QAOA 之间的联系，并自然地提出了 "相分离器 "和 "混合器 "这两个关键词的细化定义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Elementary proof of QAOA convergence

The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof involves retracing the connection between the quantum adiabatic algorithm and the QAOA, and naturally suggests a refined definition of the ‘phase separator’ and ‘mixer’ keywords.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

New Journal of Physics 物理-物理：综合

CiteScore

6.20

自引率

3.00%

发文量

504

审稿时长

3.1 months

期刊介绍： New Journal of Physics publishes across the whole of physics, encompassing pure, applied, theoretical and experimental research, as well as interdisciplinary topics where physics forms the central theme. All content is permanently free to read and the journal is funded by an article publication charge.