
Converting a measurement protocol into a quantum verification protocol. As described earlier, this is achieved by combining the [1]} protocol for BQP verification with a limited quantum verifier (as modified by [2]}) with our measurement protocol, using a PRF to generate a pseudorandom basis choice instead of a uniformly random basis choice for the [1]}, [2]} verifier. This results in a verifier-succinct argument system for BQP/QMA with constant soundness error.

Parallel repetition to reduce the soundness error. This follows from the “computational orthogonal projectors” property of the 1-bit challenge protocol and follows from [2]} (we give a somewhat more abstract formulation of their idea in appendix:cop). This results in a verifier-succinct argument system for BQP/QMA with negligible soundness error.

Converting a verifier-succinct argument system into a fully succinct argument system. We elaborate on this last transformation below, as a few difficulties come up in this step.

