In this section, we present a delegation protocol for \(\textbf {QMA}\)  with succinct verifier messages. First, in subsec:cop, we describe results due to [1]} about the parallel repetition of certain commit-challenge-response protocols with a quantum prover. Our treatment is somewhat more abstract than [1]}, so for completeness we provide proofs of all claims (based on proofs appearing in [1]}). Next, in subsec:FHM, we describe the syntax of a non-interactive, information-theoretic \(\textbf {QMA}\)  verification protocol (with quantum verifier) that we will use, due to [4]}. In subsec:semi-succinct-description, we describe a verifier-succinct protocol for \(\textbf {QMA}\)  delegation, where the verifier messages (but not the prover messages) are succinct.
