组合优化问题的量子交替算子与粒子群优化器

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Wenjie Liu , Yue Ma , Yuchen Gu , Jiajun Cheng , Qingshan Wu
{"title":"组合优化问题的量子交替算子与粒子群优化器","authors":"Wenjie Liu ,&nbsp;Yue Ma ,&nbsp;Yuchen Gu ,&nbsp;Jiajun Cheng ,&nbsp;Qingshan Wu","doi":"10.1016/j.asoc.2025.113419","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, Quantum Approximate Optimization Algorithm (QAOA) and Quantum Alternating Operator ansatz (QAOAz) are utilized to solve the Mean Variance (MV) model for the portfolio optimization problem (QAOAz-MV), which shows performance advantages over classical algorithms on this huge search space. For the more complex and comprehensive risk parity (RP) model, a novel QAOAz solution (QAOAz-RP) is proposed. We begin by defining the RP model for the portfolio optimization problem. Next, we detail the QAOAz algorithm process, where the problem Hamiltonian with the ZZZZ term is derived, the corresponding quantum circuit is ingeniously constructed using the parity check method, and the whole quantum circuit containing the ring XY-mixer is given. Finally, to improve the optimization performance of QAOAz, a Particle Swarm Optimization (PSO) optimizer is introduced to tune the parameters of the quantum circuits, which is applicable to both QAOAz-MV and QAOAz-RP. The experiment conducted on multiple financial markets (e.g. Chinese, U.S., and European) demonstrate that PSO-QAOAz-RP is significantly better for portfolio optimization than ABC-LP, GWO, GA and QAOAz-RP on eight portfolios in all metrics. PSO-QAOAz-MV also has advantage for MV model over the quantum algorithms, including QAOA (improves approximate ratio by 54.79% on average) and QAOAz (improves approximate ratio by 15.38% on average). This study not only provides a breakthrough quantum solution for portfolio optimization, but also provides a reusable technology paradigm for the deep integration of quantum computing and financial engineering.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"181 ","pages":"Article 113419"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum alternating operator ansatz with PSO optimizer for portfolio optimization problem\",\"authors\":\"Wenjie Liu ,&nbsp;Yue Ma ,&nbsp;Yuchen Gu ,&nbsp;Jiajun Cheng ,&nbsp;Qingshan Wu\",\"doi\":\"10.1016/j.asoc.2025.113419\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recently, Quantum Approximate Optimization Algorithm (QAOA) and Quantum Alternating Operator ansatz (QAOAz) are utilized to solve the Mean Variance (MV) model for the portfolio optimization problem (QAOAz-MV), which shows performance advantages over classical algorithms on this huge search space. For the more complex and comprehensive risk parity (RP) model, a novel QAOAz solution (QAOAz-RP) is proposed. We begin by defining the RP model for the portfolio optimization problem. Next, we detail the QAOAz algorithm process, where the problem Hamiltonian with the ZZZZ term is derived, the corresponding quantum circuit is ingeniously constructed using the parity check method, and the whole quantum circuit containing the ring XY-mixer is given. Finally, to improve the optimization performance of QAOAz, a Particle Swarm Optimization (PSO) optimizer is introduced to tune the parameters of the quantum circuits, which is applicable to both QAOAz-MV and QAOAz-RP. The experiment conducted on multiple financial markets (e.g. Chinese, U.S., and European) demonstrate that PSO-QAOAz-RP is significantly better for portfolio optimization than ABC-LP, GWO, GA and QAOAz-RP on eight portfolios in all metrics. PSO-QAOAz-MV also has advantage for MV model over the quantum algorithms, including QAOA (improves approximate ratio by 54.79% on average) and QAOAz (improves approximate ratio by 15.38% on average). This study not only provides a breakthrough quantum solution for portfolio optimization, but also provides a reusable technology paradigm for the deep integration of quantum computing and financial engineering.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"181 \",\"pages\":\"Article 113419\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625007306\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625007306","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

近年来,利用量子近似优化算法(QAOA)和量子交替算子ansatz (QAOAz)来求解投资组合优化问题(QAOAz-MV)的均值方差(MV)模型,在巨大的搜索空间上表现出优于经典算法的性能优势。针对较为复杂和全面的风险平价(RP)模型,提出了一种新的QAOAz解决方案(QAOAz-RP)。我们首先定义投资组合优化问题的RP模型。其次,我们详细介绍了QAOAz算法的过程,推导了带有ZZZZ项的问题哈密顿量,利用奇偶校验方法巧妙地构造了相应的量子电路,并给出了包含环形xy混频器的整个量子电路。最后,为了提高QAOAz的优化性能,引入粒子群优化(PSO)优化器对QAOAz- mv和QAOAz- rp量子电路的参数进行了调整。在多个金融市场(如中国、美国和欧洲)进行的实验表明,PSO-QAOAz-RP在8个投资组合的所有指标上都明显优于ABC-LP、GWO、GA和QAOAz-RP。PSO-QAOAz-MV在MV模型上也比量子算法有优势,QAOA(平均提高近似比54.79%)和QAOAz(平均提高近似比15.38%)。本研究不仅为投资组合优化提供了突破性的量子解决方案,也为量子计算与金融工程的深度融合提供了可重用的技术范式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Quantum alternating operator ansatz with PSO optimizer for portfolio optimization problem
Recently, Quantum Approximate Optimization Algorithm (QAOA) and Quantum Alternating Operator ansatz (QAOAz) are utilized to solve the Mean Variance (MV) model for the portfolio optimization problem (QAOAz-MV), which shows performance advantages over classical algorithms on this huge search space. For the more complex and comprehensive risk parity (RP) model, a novel QAOAz solution (QAOAz-RP) is proposed. We begin by defining the RP model for the portfolio optimization problem. Next, we detail the QAOAz algorithm process, where the problem Hamiltonian with the ZZZZ term is derived, the corresponding quantum circuit is ingeniously constructed using the parity check method, and the whole quantum circuit containing the ring XY-mixer is given. Finally, to improve the optimization performance of QAOAz, a Particle Swarm Optimization (PSO) optimizer is introduced to tune the parameters of the quantum circuits, which is applicable to both QAOAz-MV and QAOAz-RP. The experiment conducted on multiple financial markets (e.g. Chinese, U.S., and European) demonstrate that PSO-QAOAz-RP is significantly better for portfolio optimization than ABC-LP, GWO, GA and QAOAz-RP on eight portfolios in all metrics. PSO-QAOAz-MV also has advantage for MV model over the quantum algorithms, including QAOA (improves approximate ratio by 54.79% on average) and QAOAz (improves approximate ratio by 15.38% on average). This study not only provides a breakthrough quantum solution for portfolio optimization, but also provides a reusable technology paradigm for the deep integration of quantum computing and financial engineering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信