arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0905.3413quant-phcond-mat.other
收藏

相互作用玻色子问题是QMA困难的

Interacting boson problems are QMA-hard

Tzu-Chieh Wei, Michele Mosca, Ashwin Nayak

摘要:

计算相互作用电子(费米子)问题的基态能量最近被证明是很难的QMA,一个量子模拟的复杂性类NP。费米子问题通常是困难的,这一现象被广泛归因于量子蒙特卡罗模拟中出现的所谓符号问题。根据传统智慧,相应的玻色子问题是容易处理的。在这里,我们讨论了相互作用玻色子问题的复杂性,并表明它们也是QMA困难的。此外,我们表明,所谓的N-可表示性问题的玻色子版本是QMA完全的,因为它的费米版本的硬。因此,这些问题不太可能有有效的量子算法。

英文摘要:

Computing the ground-state energy of interacting electron (fermion) problems has recently been shown to be hard for QMA, a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to the so-called sign problem occurring in Quantum Monte Carlo simulations. The corresponding bosonic problems are, according to conventional wisdom, tractable. Here, we discuss the complexity of interacting boson problems and show that they are also QMA-hard. In addition, we show that the bosonic version of the so-called N-representability problem is QMA-complete, as hard as its fermionic version. As a consequence, these problems are unlikely to have efficient quantum algorithms.

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

↑