arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.01287quant-phphysics.comp-ph
收藏

量子物理和量子技术最优化问题的黎曼几何和自动微分

Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies

Ilia A. Luchnikov, Mikhail E. Krechetov, Sergey N. Filippov

摘要:

带约束的优化是量子物理和量子信息科学中的一个典型问题,对于高维系统和张量网络等复杂体系结构来说,这一问题尤其具有挑战性。在这里,我们使用黎曼几何的思想来执行酉和等距矩阵以及正定矩阵的锥流形上的优化。结合最新的自动微分计算方法,我们证明了黎曼优化在研究多体哈密顿量的低能谱和本征态、多尺度纠缠重整化方法形式的张量网络的变分搜索、任意态的制备等方面的有效性(包括高度纠缠的)量子计算的电路实现、量子门的分解和量子态的层析成像。所开发的方法的普遍性以及所提供的开源软件使人们能够将黎曼优化应用于复杂的量子体系结构,远远超出了所列出的问题,例如,噪声量子系统的最优控制。

英文摘要:

Optimization with constraints is a typical problem in quantum physics and quantum information science that becomes especially challenging for high-dimensional systems and complex architectures like tensor networks. Here we use ideas of Riemannian geometry to perform optimization on manifolds of unitary and isometric matrices as well as the cone of positive-definite matrices. Combining this approach with the up-to-date computational methods of automatic differentiation, we demonstrate the efficacy of the Riemannian optimization in the study of the low-energy spectrum and eigenstates of multipartite Hamiltonians, variational search of a tensor network in the form of the multiscale entanglement-renormalization ansatz, preparation of arbitrary states (including highly entangled ones) in the circuit implementation of quantum computation, decomposition of quantum gates, and tomography of quantum states. Universality of the developed approach together with the provided open source software enable one to apply the Riemannian optimization to complex quantum architectures well beyond the listed problems, for instance, to the optimal control of noisy quantum systems.

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

↑