发表机构
IBM Research; Columbia University; UIUC（IBM研究院; 哥伦比亚大学; 伊利诺伊大学厄巴纳-香槟分校）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文通过构造经典预言机，基于可分离哈密顿量问题，证明了QMA与QMA(2)的分离，并利用压缩预言机技术建立QMA下界。
AI 中文摘要
我们展示了一个经典预言机，相对于该预言机，QMA ≠ QMA(2)。该分离基于一个由图上带符号边约束定义的可分离哈密顿量问题。YES实例具有零能量乘积态，而NO实例（使用反对称子空间构造）具有纠缠的零能量态，但没有低能量乘积态。对于QMA下界，我们使用压缩预言机技术来追踪量子计算在少量查询YES实例时学习到的信息。关键步骤是将部分预言机记录的叠加态映射到NO族，而不显著改变验证者的行为。
英文摘要
We exhibit a classical oracle relative to which QMA \neq QMA(2). The separation is based on a separable Hamiltonian problem defined by signed edge constraints on a graph. The YES instances have zero-energy product states, while the NO instances, constructed using the antisymmetric subspace, have entangled zero-energy states but no low-energy product states. For the QMA lower bound, we use compressed-oracle techniques to track the information learned by a quantum computation making few queries to a YES instance. The key step is to map the resulting superpositions of partial oracle records to the NO family without significantly changing the verifier's behavior.
