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

3-局部哈密顿量问题与常数相对误差量子配分函数近似:QSETH 下 $O(2^{\frac{n}{2}})$ 算法近乎最优

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH

Rice University(莱斯大学)

Nai-Hui Chia, Yu-Ching Shen

AI总结:

本文在QSETH假设下证明3-局部哈密顿量问题和量子配分函数近似的最优算法运行时间为$O(2^{n/2})$,并给出匹配的量子算法,为固定局部性问题提供首个细粒度下界。

摘要:

我们研究了局部哈密顿量(LH)问题和量子配分函数(QPF)近似的计算复杂性,这两个问题是量子多体物理和量子复杂性理论中的核心问题。已知这两个问题都是 QMA-hard 的,并且在广泛接受的假设 $\mathsf{BQP} \neq \mathsf{QMA}$ 下,不存在高效的量子算法。目前已知的最优 LH 量子算法运行时间为 $O\bigl(2^{\frac{n}{2}(1 - o(1))}\bigr)$,而对于 QPF,最先进的算法在 $O^\ast\bigl(\frac{1}{\delta}\sqrt{\frac{2^n}{Z}}\bigr)$ 时间内实现相对误差 $\delta$,其中 $Z$ 表示配分函数的值。一个自然的问题是,对于这两个问题是否存在更高效的算法。\n 在这项工作中,我们建立了严格的条件性下界,表明这些算法是近乎最优的。在合理的量子强指数时间假设(QSETH)下,我们证明没有任何量子算法能够显著快于 $O(2^{n/2})$ 来解决 LH 或近似 QPF,即使对于 3-局部哈密顿量也是如此。特别地,我们证明了:1) 在 QSETH 下,对于任何 $\varepsilon > 0$,3-局部 LH 不能在 $O(2^{\frac{n}{2}(1-\varepsilon)})$ 时间内解决;2) 在 QSETH 下,对于任何 $\varepsilon > 0$,3-局部 QPF 不能在 $O(2^{\frac{n}{2}(1-\varepsilon)})$ 时间内近似到任意常数相对误差;3) 我们提出了一种量子算法,在 $O^\ast(2^{n/2})$ 时间内将 QPF 近似到相对误差 $1/2 + 1/\mathrm{poly}(n)$,与我们的条件性下界相匹配。\n 值得注意的是,我们的结果为具有固定局部性的 LH 和 QPF 提供了首个细粒度下界。这与 QSETH 和 LH 的平凡细粒度下界形成鲜明对比,在后者中,SAT 实例和哈密顿量的局部性依赖于 $O(2^{\frac{n}{2}(1-\varepsilon)})$ 运行时间中的参数 $\varepsilon$。

英文摘要:

We investigate the computational complexity of the Local Hamiltonian (LH) problem and the approximation of the Quantum Partition Function (QPF), two central problems in quantum many-body physics and quantum complexity theory. Both problems are known to be QMA-hard, and under the widely believed assumption that $\mathsf{BQP} \neq \mathsf{QMA}$, no efficient quantum algorithm exits. The best known quantum algorithm for LH runs in $O\bigl(2^{\frac{n}{2}(1 - o(1))}\bigr)$ time, while for QPF, the state-of-the-art algorithm achieves relative error $δ$ in $O^\ast\bigl(\frac{1}δ\sqrt{\frac{2^n}{Z}}\bigr)$ time, where $Z$ denotes the value of the partition function. A nature open question is whether more efficient algorithms exist for both problems. In this work, we establish tight conditional lower bounds showing that these algorithms are nearly optimal. Under the plausible Quantum Strong Exponential Time Hypothesis (QSETH), we prove that no quantum algorithm can solve either LH or approximate QPF significantly faster than $O(2^{n/2})$, even for 3-local Hamiltonians. In particular, we show: 1) 3-local LH cannot be solved in time $O(2^{\frac{n}{2}(1-\varepsilon)})$ for any $\varepsilon > 0$ under QSETH; 2) 3-local QPF cannot be approximated up to any constant relative error in $O(2^{\frac{n}{2}(1-\varepsilon)})$ time for any $\varepsilon > 0$ under QSETH; and 3) we present a quantum algorithm that approximates QPF up to relative error $1/2 + 1/\mathrm{poly}(n)$ in $O^\ast(2^{n/2})$ time, matching our conditional lower bound. Notably, our results provide the first fine-grained lower bounds for both LH and QPF with fixed locality. This stands in sharp contrast to QSETH and the trivial fine-grained lower bounds for LH, where the locality of the SAT instance and the Hamiltonian depends on the parameter $\varepsilon$ in the $O(2^{\frac{n}{2}(1-\varepsilon)})$ running time.

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

↑