Succinct Arguments for QMA in the Quantum Random Oracle Model

Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone e.g., hash functions by compiling probabilistically checkable proofs PC...