纯量子梯度下降算法和全量子变分特征求解器

IF 6.5 2区 物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY
Ronghang Chen, Zhou Guang, Cong Guo, Guanru Feng, Shi-Yao Hou
{"title":"纯量子梯度下降算法和全量子变分特征求解器","authors":"Ronghang Chen,&nbsp;Zhou Guang,&nbsp;Cong Guo,&nbsp;Guanru Feng,&nbsp;Shi-Yao Hou","doi":"10.1007/s11467-023-1346-7","DOIUrl":null,"url":null,"abstract":"<div><p>Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with <i>d</i> variables necessitates at least <i>d</i> + 1 function evaluations, resulting in a computational complexity of <i>O</i>(<i>d</i>). As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in quantum mechanics, quantum computers can achieve genuine parallel computing, leading to exponential acceleration over classical algorithms in some cases. In this paper, we propose a novel quantum-based gradient calculation method that requires only a single oracle calculation to obtain the numerical gradient result for a multivariate function. The complexity of this algorithm is just <i>O</i>(1). Building upon this approach, we successfully implemented the quantum gradient descent algorithm and applied it to the variational quantum eigensolver (VQE), creating a pure quantum variational optimization algorithm. Compared with classical gradient-based optimization algorithm, this quantum optimization algorithm has remarkable complexity advantages, providing an efficient solution to optimization problems. The proposed quantum-based method shows promise in enhancing the performance of optimization algorithms, highlighting the potential of quantum computing in this field.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>","PeriodicalId":573,"journal":{"name":"Frontiers of Physics","volume":null,"pages":null},"PeriodicalIF":6.5000,"publicationDate":"2023-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Pure quantum gradient descent algorithm and full quantum variational eigensolver\",\"authors\":\"Ronghang Chen,&nbsp;Zhou Guang,&nbsp;Cong Guo,&nbsp;Guanru Feng,&nbsp;Shi-Yao Hou\",\"doi\":\"10.1007/s11467-023-1346-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with <i>d</i> variables necessitates at least <i>d</i> + 1 function evaluations, resulting in a computational complexity of <i>O</i>(<i>d</i>). As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in quantum mechanics, quantum computers can achieve genuine parallel computing, leading to exponential acceleration over classical algorithms in some cases. In this paper, we propose a novel quantum-based gradient calculation method that requires only a single oracle calculation to obtain the numerical gradient result for a multivariate function. The complexity of this algorithm is just <i>O</i>(1). Building upon this approach, we successfully implemented the quantum gradient descent algorithm and applied it to the variational quantum eigensolver (VQE), creating a pure quantum variational optimization algorithm. Compared with classical gradient-based optimization algorithm, this quantum optimization algorithm has remarkable complexity advantages, providing an efficient solution to optimization problems. The proposed quantum-based method shows promise in enhancing the performance of optimization algorithms, highlighting the potential of quantum computing in this field.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>\",\"PeriodicalId\":573,\"journal\":{\"name\":\"Frontiers of Physics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2023-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers of Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11467-023-1346-7\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers of Physics","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11467-023-1346-7","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1

摘要

优化问题普遍存在于各个领域,基于梯度下降算法是一种被广泛采用的优化方法。然而,在经典计算中,计算具有d个变量的函数的数值梯度至少需要d + 1次函数求值,导致计算复杂度为O(d)。随着变量数量的增加,经典的梯度估计方法需要大量的资源,最终超出了经典计算机的能力。幸运的是,利用量子力学中的叠加和纠缠原理,量子计算机可以实现真正的并行计算,在某些情况下导致经典算法的指数加速。在本文中,我们提出了一种新的基于量子的梯度计算方法,它只需要一次oracle计算就可以获得多元函数的数值梯度结果。该算法的复杂度为0(1)。在此基础上,我们成功地实现了量子梯度下降算法,并将其应用于变分量子特征求解器(VQE),创建了一个纯量子变分优化算法。与经典的基于梯度的优化算法相比,量子优化算法具有显著的复杂度优势,能够有效地解决优化问题。提出的基于量子的方法有望提高优化算法的性能,突出了量子计算在该领域的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Pure quantum gradient descent algorithm and full quantum variational eigensolver

Pure quantum gradient descent algorithm and full quantum variational eigensolver

Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with d variables necessitates at least d + 1 function evaluations, resulting in a computational complexity of O(d). As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in quantum mechanics, quantum computers can achieve genuine parallel computing, leading to exponential acceleration over classical algorithms in some cases. In this paper, we propose a novel quantum-based gradient calculation method that requires only a single oracle calculation to obtain the numerical gradient result for a multivariate function. The complexity of this algorithm is just O(1). Building upon this approach, we successfully implemented the quantum gradient descent algorithm and applied it to the variational quantum eigensolver (VQE), creating a pure quantum variational optimization algorithm. Compared with classical gradient-based optimization algorithm, this quantum optimization algorithm has remarkable complexity advantages, providing an efficient solution to optimization problems. The proposed quantum-based method shows promise in enhancing the performance of optimization algorithms, highlighting the potential of quantum computing in this field.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Frontiers of Physics
Frontiers of Physics PHYSICS, MULTIDISCIPLINARY-
CiteScore
9.20
自引率
9.30%
发文量
898
审稿时长
6-12 weeks
期刊介绍: Frontiers of Physics is an international peer-reviewed journal dedicated to showcasing the latest advancements and significant progress in various research areas within the field of physics. The journal's scope is broad, covering a range of topics that include: Quantum computation and quantum information Atomic, molecular, and optical physics Condensed matter physics, material sciences, and interdisciplinary research Particle, nuclear physics, astrophysics, and cosmology The journal's mission is to highlight frontier achievements, hot topics, and cross-disciplinary points in physics, facilitating communication and idea exchange among physicists both in China and internationally. It serves as a platform for researchers to share their findings and insights, fostering collaboration and innovation across different areas of physics.
×
引用
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学术官方微信