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

量子约束问题可以针对$\mathsf{BQP}$、$\mathsf{QCMA}$等完成

Quantum Constraint Problems can be complete for $\mathsf{BQP}$, $\mathsf{QCMA}$, and more

Alex Meiburg

摘要:

一个量子约束问题是一个无阻挫的哈密顿问题:给定一个局部算符的集合,是否有一个状态同时处于每个算符的基态?以前已经证明,这些问题可以在P,NP-完全,MA-完全,或QMA_1-完全,但这个列表还没有被证明是详尽无遗的。我们提出了三个量子约束问题:(1)BQP_1-完备(也称为coRQP),(2)QCMA_1-完备和(3)coRP-完备。这提供了BQP_1的第一个自然完整问题。我们还表明,所有的量子约束问题可以实现量子比特,一个特质不共享与经典的约束问题。这些结果表明,量子约束问题中存在的复杂性类的显着多样性。

英文摘要:

A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems can be in P, NP-complete, MA-complete, or QMA_1-complete, but this list has not been shown to be exhaustive. We present three quantum constraint problems, that are (1) BQP_1-complete (also known as coRQP), (2) QCMA_1-complete and (3) coRP-complete. This provides the first natural complete problem for BQP_1. We also show that all quantum constraint problems can be realized on qubits, a trait not shared with classical constraint problems. These results suggest a significant diversity of complexity classes present in quantum constraint problems.

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

↑