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

量子化学应用中变分量子本征求解器的优化

Optimization of the Variational Quantum Eigensolver for Quantum Chemistry Applications

R. J. P. T. de Keijzer, V. E. Colussi, B. Škorić, S. J. J. M. F. Kokkelmans

摘要:

本文研究了结合经典和量子硬件的变分量子本征求解器算法,用于确定量子力学系统的基态。研究了减少变分量子本征求解器所需量子比特操作次数的方法。我们正式证明了Bravyi,Gambetta,Mezzacapo和Temme [arXiv:1701.08213(2017)]所描绘的量子位移除过程。此外,通过计算H $_2$和LiH的基态能量,对基于门的和本机的不同经典优化和纠缠方法进行了调查。本文旨在为纠缠方法和经典优化方法提供基于性能的建议。分析VQE问题是复杂的,其中优化算法、纠缠方法和搜索空间的维度都相互作用。然而,在特定情况下,可以显示具体的结果,并且可以推荐一种缠绕方法或优化算法。特别是,我们发现,对于高维数(许多量子比特和/或纠缠深度),某些经典的优化算法优于其他的能量误差。

英文摘要:

This work studies the variational quantum eigensolver algorithm, designed to determine the ground state of a quantum mechanical system by combining classical and quantum hardware. Methods of reducing the number of required qubit manipulations, prone to induce errors, for the variational quantum eigensolver are studied. We formally justify the qubit removal process as sketched by Bravyi, Gambetta, Mezzacapo and Temme [arXiv:1701.08213 (2017)]. Furthermore, different classical optimization and entangling methods, both gate based and native, are surveyed by computing ground state energies of H$_2$ and LiH. This paper aims to provide performance-based recommendations for entangling methods and classical optimization methods. Analyzing the VQE problem is complex, where the optimization algorithm, the method of entangling, and the dimensionality of the search space all interact. In specific cases however, concrete results can be shown, and an entangling method or optimization algorithm can be recommended over others. In particular we find that for high dimensionality (many qubits and/or entanglement depth) certain classical optimization algorithms outperform others in terms of energy error.

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

↑