David Miloschewsky, Supartha Podder, Dorian Rudolph (Apr 30 2026).
Abstract: We study the power of quantum witnesses under perfect completeness. We construct a classical oracle relative to which a language lies in
QMA1​ but not in
QCMA when the
QCMA verifier is only allowed polynomially many adaptive rounds and exponentially many parallel queries per round. Additionally, we derandomize the permutation-oracle separation of Fefferman and Kimmel, obtaining an in-place oracle separation between
QMA1​ and
QCMA. Furthermore, we focus on
QCMA and
QMA with an exponentially small gap, where we show a separation assuming the gap is fixed, but not when it may be arbitrarily small. Finally, we derive consequences for approximate ground-state preparation from sparse Hamiltonian oracle access, including a bounded-adaptivity frustration-free variant.