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

面向量子应用的随机优化算法

Stochastic optimization algorithms for quantum applications

J. Gidi, B. Candia, A. D. Muñoz-Moller, A. Rojas, L. Pereira, M. Muñoz, L. Zambrano, A. Delgado

AI总结:

本文回顾了实数域上的随机优化方法,提出了复数域上的新随机优化算法,并应用于变分量子本征求解器等量子任务,发现复数优化算法表现最佳。

摘要:

混合经典量子优化方法已成为在当前一代 NISQ 计算机上高效解决问题的重要工具。这些方法使用在经典计算机上执行的优化算法,该算法由量子处理器中获得的目标函数值进行驱动。优化算法的适当选择对于实现良好性能至关重要。在此,我们回顾了定义在实数域上的一阶、二阶和量子自然梯度随机优化方法的使用,并提出了定义在复数域上的新随机算法。所有方法的性能均通过将其应用于变分量子本征求解器、量子态的量子控制以及量子态估计来评估。总体而言,复数优化算法表现最佳,其中一阶复数算法持续取得最佳性能,紧随其后的是无需昂贵超参数校准的复数量子自然算法。特别是,复数量子自然算法的标量公式化能够以较低的经典计算成本实现良好的性能。

英文摘要:

Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of NISQ computers. These methods use an optimization algorithm executed in a classical computer, fed with values of the objective function obtained in a quantum processor. A proper choice of optimization algorithm is essential to achieve good performance. Here, we review the use of first-order, second-order, and quantum natural gradient stochastic optimization methods, which are defined in the field of real numbers, and propose new stochastic algorithms defined in the field of complex numbers. The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation. In general, complex number optimization algorithms perform best, with first-order complex algorithms consistently achieving the best performance, closely followed by complex quantum natural algorithms, which do not require expensive hyperparameters calibration. In particular, the scalar formulation of the complex quantum natural algorithm allows to achieve good performance with low classical computational cost.

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

↑