arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.13858quant-phcs.LGmath.OC
收藏

量子自然随机逐对坐标下降

Quantum Natural Stochastic Pairwise Coordinate Descent

University of Michigan(密歇根大学);Indiana University(印第安纳大学)

Mohammad Aamir Sohail, Mohsen Heidari, S. Sandeep Pradhan

AI总结:

本文提出一种基于新型量子信息度量与单次测量无偏估计器的量子自然随机逐对坐标下降算法,在避免全态层析的同时实现更快收敛和更低采样复杂度,并能避开鞍点与局部极小值。

摘要:

使用基于梯度的方法进行优化的变分量子算法,由于依赖于欧几里得几何,往往表现出次优的收敛性能。量子自然梯度下降(QNGD)是一种更高效的方法,它通过量子信息度量引入态空间的几何结构。然而,QNGD 计算密集且采样复杂度高。在本工作中,我们构造了一种新的量子信息度量,并利用单次测量为该度量构建了一个无偏估计器。我们开发了一种量子优化算法,该算法通过该估计器利用态空间的几何结构,同时避免了传统技术中的全态层析。我们在温和条件下给出了该算法的收敛性分析。此外,我们提供了实验结果,证明与最先进的方法相比,我们的算法具有更好的采样复杂度和更快的收敛速度。我们的结果说明了该算法能够避开鞍点和局部极小值。

英文摘要:

Variational quantum algorithms, optimized using gradient-based methods, often exhibit sub-optimal convergence performance due to their dependence on Euclidean geometry. Quantum natural gradient descent (QNGD) is a more efficient method that incorporates the geometry of the state space via a quantum information metric. However, QNGD is computationally intensive and suffers from high sample complexity. In this work, we formulate a novel quantum information metric and construct an unbiased estimator for this metric using single-shot measurements. We develop a quantum optimization algorithm that leverages the geometry of the state space via this estimator while avoiding full-state tomography, as in conventional techniques. We provide the convergence analysis of the algorithm under mild conditions. Furthermore, we provide experimental results that demonstrate the better sample complexity and faster convergence of our algorithm compared to the state-of-the-art approaches. Our results illustrate the algorithm's ability to avoid saddle points and local minima.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑