Preprint
Oct 2026
Separating ClonableQMA and QCMA Relative to a Classical Oracle
Since the introduction of the complexity class QMA as a quantum-verifier analogue of NP (Kitaev, 1997), many have wondered whether quantum proofs are necessary or classical proofs suffice - that is, whether QMA = QCMA or QCMA != QMA (Aharonov and Naveh, 2002; Aaronson and Kuperberg, CCC'07). This longstanding question...
Alper Çakan, Kai-Min Chung, Wei-Hsiang Hung et al.
· 0 citations