Skip to content

Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA

Alper Cakan

quant-pharXiv:2611.26574

Abstract

Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate QMA from QCIP, we introduce a new problem called Codeword-Hash pairs in Noise (CHN) and prove that, in the query complexity model, it is in QMA but hard for the QCMA hierarchy QCMAH = d≥1QCMAQCMA·sQCMA, the classical-witness quantum-verifier analogue of PH=d1NPNP·sNP. Using this problem, we show that there exists a classical oracle O such that PO=BQPO=QCMAO =QCMAHO ⊂ QMAO but QMAO⊂eqQCMAHO, thus showing that quantum state or quantum proof advantage could exist even if classical computers can efficiently solve any problem that can be quantumly verified with a classical proof. Further, using our problem, we show that various quantum cryptographic primitives can exist even when P = QCMA and thus neither quantum-computable one-way functions nor (verifiable) quantum computational advantage exist. In particular, relative to a classical oracle O with PO=BQPO=QCMAO=QCMAHO, there exist pseudorandom states with classical keys and public-key encryption with copy-protected quantum decryption keys and classical public keys and ciphertexts, among other primitives, answering an open question of Kretschmer, Qian, and Tal (STOC 2025).

Create a lesson