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

可分Hamilton问题的复杂性

The Complexity of the Separable Hamiltonian Problem

André Chailloux, Or Sattath

摘要:

在本文中,我们研究变种的典型的局部哈密顿问题,此外,证人承诺是可分离的。我们定义了两个变种的局部哈密顿问题。可分离局域哈密顿问题的输入与局域哈密顿问题相同,即一个局域哈密顿量和两个能量a和b,但问题有些不同:如果存在能量至多为a的可分离量子态,则答案为是;如果所有可分离量子态的能量至少为b,则答案为否。可分离-稀疏-哈密尔顿问题的定义类似,但哈密尔顿算子不一定是局部的,而是稀疏的。证明了可分稀疏Hamilton问题是QMA(2)-完全的,而可分局部Hamilton问题是QMA(2)-完全的.这应该与局部哈密顿问题和稀疏哈密顿问题进行比较,这两个问题都是QMA完全的。据我们所知,可分稀疏哈密尔顿算子是第一个证明为QMA(2)-完全的非平凡问题。

英文摘要:

In this paper, we study variants of the canonical Local-Hamiltonian problem where, in addition, the witness is promised to be separable. We define two variants of the Local-Hamiltonian problem. The input for the Separable-Local-Hamiltonian problem is the same as the Local-Hamiltonian problem, i.e. a local Hamiltonian and two energies a and b, but the question is somewhat different: the answer is YES if there is a separable quantum state with energy at most a, and the answer is NO if all separable quantum states have energy at least b. The Separable-Sparse-Hamiltonian problem is defined similarly, but the Hamiltonian is not necessarily local, but rather sparse. We show that the Separable-Sparse-Hamiltonian problem is QMA(2)-Complete, while Separable-Local-Hamiltonian is in QMA. This should be compared to the Local-Hamiltonian problem, and the Sparse-Hamiltonian problem which are both QMA-Complete. To the best of our knowledge, Separable-SPARSE-Hamiltonian is the first non-trivial problem shown to be QMA(2)-Complete.

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

↑