Enhancing quantum approximate optimization with CNN-CVaR integration

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL
Pengnian Cai, Kang Shen, Tao Yang, Yuanming Hu, Bin Lv, Liuhuan Fan, Zeyu Liu, Qi Hu, Shixian Chen, Yunlai Zhu, Zuheng Wu, Yuehua Dai, Fei Yang, Jun Wang, Zuyu Xu
{"title":"Enhancing quantum approximate optimization with CNN-CVaR integration","authors":"Pengnian Cai,&nbsp;Kang Shen,&nbsp;Tao Yang,&nbsp;Yuanming Hu,&nbsp;Bin Lv,&nbsp;Liuhuan Fan,&nbsp;Zeyu Liu,&nbsp;Qi Hu,&nbsp;Shixian Chen,&nbsp;Yunlai Zhu,&nbsp;Zuheng Wu,&nbsp;Yuehua Dai,&nbsp;Fei Yang,&nbsp;Jun Wang,&nbsp;Zuyu Xu","doi":"10.1007/s11128-025-04655-3","DOIUrl":null,"url":null,"abstract":"<div><p>The quantum approximate optimization algorithm (QAOA) represents a promising approach for tackling combinatorial optimization challenges on near-term quantum devices. Central to QAOA optimization is the minimization of the expectation of the problem Hamiltonian for parameterized trial quantum states, which motivates the exploration of advanced optimization techniques. In this study, we propose a novel combinatorial optimization strategy, CNN-CVaR-QAOA, which integrates a convolutional neural network (CNN) with conditional value at risk (CVaR) to optimize QAOA circuits. By replacing the traditional loss function with CVaR and leveraging CNN for variational quantum parameter optimization, we demonstrate the superior efficacy of CNN-CVaR-QAOA through experimental validation on Erdos–Renyi random graphs. Our results show better solutions across various graph configurations. Furthermore, we investigate the influence of the CVaR parameter (<span>\\(\\alpha \\)</span>) on algorithm performance, revealing that lower <span>\\(\\alpha \\)</span> values lead to smoother objective functions and improved approximation ratios. This work indicates that CNN-CVaR-QAOA offers significant advantages in optimizing QAOA parameters, particularly in the context of near-term intermediate-scale quantum era, highlighting its potential to enhance QAOA optimization efforts across diverse optimization domains.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-025-04655-3.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-025-04655-3","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

The quantum approximate optimization algorithm (QAOA) represents a promising approach for tackling combinatorial optimization challenges on near-term quantum devices. Central to QAOA optimization is the minimization of the expectation of the problem Hamiltonian for parameterized trial quantum states, which motivates the exploration of advanced optimization techniques. In this study, we propose a novel combinatorial optimization strategy, CNN-CVaR-QAOA, which integrates a convolutional neural network (CNN) with conditional value at risk (CVaR) to optimize QAOA circuits. By replacing the traditional loss function with CVaR and leveraging CNN for variational quantum parameter optimization, we demonstrate the superior efficacy of CNN-CVaR-QAOA through experimental validation on Erdos–Renyi random graphs. Our results show better solutions across various graph configurations. Furthermore, we investigate the influence of the CVaR parameter (\(\alpha \)) on algorithm performance, revealing that lower \(\alpha \) values lead to smoother objective functions and improved approximation ratios. This work indicates that CNN-CVaR-QAOA offers significant advantages in optimizing QAOA parameters, particularly in the context of near-term intermediate-scale quantum era, highlighting its potential to enhance QAOA optimization efforts across diverse optimization domains.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Quantum Information Processing
Quantum Information Processing 物理-物理:数学物理
CiteScore
4.10
自引率
20.00%
发文量
337
审稿时长
4.5 months
期刊介绍: Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信