首页> 外文会议>Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on >The Complexity of the Separable Hamiltonian Problem
【24h】

The Complexity of the Separable Hamiltonian Problem

机译:可分离的哈密顿量问题的复杂性

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:在本文中,我们研究了规范的局部哈密顿问题的变体,此外,证人被证明是可分离的。我们定义了局部哈密顿问题的两个变体。可分离局部哈密顿量问题的输入与局部哈密顿量问题相同,即,局部哈密顿量和两个能量a和b,但问题有所不同:如果存在一个最多具有能量的可分离量子态,答案为是。 a,如果所有可分离的量子态均具有至少b的能量,则答案为否。可分离稀疏哈密顿问题的定义与此类似,但是哈密顿不一定是局部的,而是稀疏的。我们表明,可分离的稀疏哈密顿问题是QMA(2)-完全,而可分离的局部哈密顿问题在QMA中。可以将其与都为QMA-Complete的Local Hamiltonian问题和Sparse Hamiltonian问题进行比较。据我们所知,可分离的稀疏哈密顿量是第一个被证明是QMA(2)-完全的非平凡问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号