Toward Separating QMA from QCMA with a Classical Oracle
Quantum Physics
2024-11-05 v1 Computational Complexity
Abstract
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.
Cite
@article{arxiv.2411.01718,
title = {Toward Separating QMA from QCMA with a Classical Oracle},
author = {Mark Zhandry},
journal= {arXiv preprint arXiv:2411.01718},
year = {2024}
}