Year: 2026
Type: preprint
Abstract: We construct a classical oracle relative to which QMA is not contained in the QCMA hierarchy. Our main technical contribution is a switching lemma for bounded polynomials, which provides a new conceptual viewpoint on earlier sampler-based arguments separating QMA and QCMA. Crucially, the parameters of this switching lemma are independent of the number of input variables. The separation builds on the code intersection subset size problem of Bostanci, Huang, and Vaikuntanathan (FOCS 2026). We also construct a classical oracle relative to which QCMA collapses to P but QMA does not, and another relative to which QMA collapses to P but PP does not.
Source: arXiv (Cornell University)
Author: Wang, Yiming
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236582332
