arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.0770quant-ph
收藏

交换局部Hamilton系统的复杂性及其拓扑序的紧条件

On the complexity of Commuting Local Hamiltonians, and tight conditions for Topological Order in such systems

Dorit Aharonov, Lior Eldar

摘要:

局域哈密顿问题在量子复杂性理论中扮演着SAT的等价角色。理解的复杂性的中间情况下,其中的约束是量子的,但所有的本地项在哈密顿交换,是重要的概念,物理和计算的复杂性的原因。Bravyi和Vyalyi在2003年巧妙地应用了C*-代数的表示理论,证明了如果哈密顿量中的项都是双定域的,那么问题是NP问题,并且基态中的纠缠是定域的。一般案件自那时以来一直悬而未决。在本文中,我们将Bravyi和Vyalyi的结果从两个局部的情况扩展到三个量子比特相互作用的情况。然后,我们进一步扩展我们的结果,并表明NP验证是可能的qutrits之间的三明智的相互作用,以及,只要相互作用图是嵌入在一个平面晶格,或更一般地说,“近欧几里德”(NE)。证明了在所有这样的系统中,基态的纠缠都是局域的。这些扩展意味着在交换哈密顿系统中一个有趣的急剧转变现象:基于量子比特和量子比特的3-局部NE系统不能用于构造拓扑序,因为它们的纠缠是局部的,而对于更高维的量子比特,或者至少4个量子比特的相互作用,拓扑序已经是可能的,通过Kitaev的Toric Code构造。因此,我们得出结论,Kitaev的Toric码的建设是最佳的衍生拓扑秩序的基础上交换哈密顿。

英文摘要:

The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of importance for conceptual, physical and computational complexity reasons. Bravyi and Vyalyi showed in 2003, using a clever application of the representation theory of C*-algebras, that if the terms in the Hamiltonian are all two-local, the problem is in NP, and the entanglement in the ground states is local. The general case remained open since then. In this paper we extend the results of Bravyi and Vyalyi beyond the two-local case, to the case of three-qubit interactions. We then extend our results even further, and show that NP verification is possible for three-wise interaction between qutrits as well, as long as the interaction graph is embedded on a planar lattice, or more generally, "Nearly Euclidean" (NE). The proofs imply that in all such systems, the entanglement in the ground states is local. These extensions imply an intriguing sharp transition phenomenon in commuting Hamiltonian systems: 3-local NE systems based on qubits and qutrits cannot be used to construct Topological order, as their entanglement is local, whereas for higher dimensional qudits, or for interactions of at least 4 qudits, Topological Order is already possible, via Kitaev's Toric Code construction. We thus conclude that Kitaev's Toric Code construction is optimal for deriving topological order based on commuting Hamiltonians.

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

↑