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, 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","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.
期刊介绍:
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.