QCMA ⊆ QMA
Statement
: every QCMA proof system becomes a QMA proof system when the verifier first measures the witness register in the computational basis — folklore.
Sketch
The honest classical witness is sent as a computational-basis state, so completeness is unchanged. Measuring any quantum witness yields a distribution over classical strings, and the acceptance probability is the average of the QCMA verifier’s acceptance probabilities over it, hence at most on no-instances.