Succinct Classical Arguments for Quantum Merlin-Arthur (QMA) Problems from Standard Cryptographic Assumptions

The authors construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions such as collapsing hash functions and a mild version of quantum homomorphic encryption. This avoids the need for the stronger assumption of post-quantum indistinguishability obfuscation required in prior work.