QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum verifier only is given a classical witness. A challenging fundamental goal in quantum query complexity is to find a classical oracle separation for these classes. In this work, we offer a new approach towards proving such a separation that is qualitatively different than prior work, and show that our approach is sound assuming a natural statistical conjecture which may have other applications to quantum query complexity lower bounds.

翻译：QMA（量子梅林-亚瑟）类是指可由高效量子验证器在给定量子见证态时判定的语言集合，而QCMA（经典梅林-亚瑟）类则指仅向高效量子验证器提供经典见证时能够判定的同类语言。量子查询复杂性领域的一个根本性挑战目标是找到能够区分这两类语言的经典预言机分离方案。本研究提出了一种在性质上不同于先前工作的新路径来证明此类分离，并证明在假定一个可能对量子查询复杂性下界具有其他应用价值的自然统计猜想成立的前提下，我们所提出的方法是可靠的。