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

量子局部哈密顿量的改进乘积态近似算法

Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians

Thiago Bergamaschi

AI总结:

本文为特定量子k-局部哈密顿量族开发了经典乘积态近似算法,通过弱Szemerédi正则引理和图性质测试技术,扩展了自由能和非对称图设置的信息论方法,改进了基态能量和自由能的估计。

摘要:

量子局部哈密顿量的基态能量和自由能是多体物理学中的基本量,但一般情况下估计它们是QMA-Hard的。本文为某些量子k-局部哈密顿量族开发了新技术,寻找这些量的经典加性误差乘积态近似,包括稠密、低阈值秩或在排除固定子式的稀疏图上定义的系统,基于Brandão和Harrow、Gharibian和Kempe、Bansal、Bravyi和Terhal的方法。我们提出两项主要技术贡献:首先,讨论局部哈密顿量乘积态近似与组合图性质测试的联系,开发了k-局部哈密顿量的弱Szemerédi正则引理,用于常数时间采样算法,并刻画局部哈密顿量问题的顶点采样复杂度;其次,扩展Brandão和Harrow的信息论乘积态近似技术至自由能和非对称图设置,定义低温自由能算法族及稀疏图族新算法。

英文摘要:

The ground state energy and the free energy of Quantum Local Hamiltonians are fundamental quantities in quantum many-body physics, however, it is QMA-Hard to estimate them in general. In this paper, we develop new techniques to find classical, additive error product-state approximations for these quantities on certain families of Quantum $k$-Local Hamiltonians. Namely, those which are either dense, have low threshold rank, or are defined on a sparse graph that excludes a fixed minor, building on the methods and the systems studied by Brandão and Harrow, Gharibian and Kempe, and Bansal, Bravyi and Terhal. We present two main technical contributions. First, we discuss a connection between product-state approximations of local Hamiltonians and combinatorial graph property testing. We develop a series of weak Szemerédi regularity lemmas for $k$-local Hamiltonians, built on those of Frieze and Kannan and others. We use them to develop constant time sampling algorithms, and to characterize the `vertex sample complexity' of the Local Hamiltonian problem, in an analog to a classical result by Alon, de la Vega, Kannan and Karpinski. Second, we build on the information-theoretic product-state approximation techniques by Brandão and Harrow, extending their results to the free energy and to an asymmetric graph setting. We leverage this structure to define families of algorithms for the free energy at low temperatures, and new algorithms for certain sparse graph families.

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

↑