arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.10097quant-phcs.CC
收藏

引导局域哈密顿量问题的复杂性:改进参数及扩展到激发态

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States

Chris Cade, Marten Folkertsma, Jordi Weggemans

AI总结:

该研究证明引导局域哈密顿量问题在2-局域、高重叠及激发态情形下仍为BQP完全,改进了先前结果。

摘要:

最近研究表明,所谓的引导局域哈密顿量问题——在给定一个量子态(“引导态”)的描述且该态被保证与真实基态有显著重叠时,估计$k$-局域哈密顿量的最小本征值——当所需精度为系统大小$n$的逆多项式时,对于$k \geq 6$是BQP完全的,并且即使引导态与基态的重叠接近常数$\left(\frac12 - \Omega\left(\frac{1}{\mathop{poly}(n)}\right)\right)$,问题仍然困难。我们以三种方式改进了这一结果:通过证明当i)哈密顿量是2-局域的,ii)引导态与目标本征态之间的重叠高达$1 - \Omega\left(\frac{1}{\mathop{poly}(n)}\right)$,以及iii)当人们感兴趣的是估计激发态能量而非仅基态能量时,问题仍然是BQP完全的。有趣的是,iii)只有在首先证明ii)成立的情况下才成为可能。

英文摘要:

Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a $k$-local Hamiltonian when provided with a description of a quantum state ('guiding state') that is guaranteed to have substantial overlap with the true groundstate -- is BQP-complete for $k \geq 6$ when the required precision is inverse polynomial in the system size $n$, and remains hard even when the overlap of the guiding state with the groundstate is close to a constant $\left(\frac12 - Ω\left(\frac{1}{\mathop{poly}(n)}\right)\right)$. We improve upon this result in three ways: by showing that it remains BQP-complete when i) the Hamiltonian is 2-local, ii) the overlap between the guiding state and target eigenstate is as large as $1 - Ω\left(\frac{1}{\mathop{poly}(n)}\right)$, and iii) when one is interested in estimating energies of excited states, rather than just the groundstate. Interestingly, iii) is only made possible by first showing that ii) holds.

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

↑