Interactive Proofs for Quantum Computation

Providing solution to the functionality Verification of Quantum Computation, is a class MA (Merlin-Arthur) that consists of all the problems whose solution can be verified by a BPP machine (verifier that has a classical computer) when given a proof by a 'witness' (prover). As MA does not include BQP (problems that can be solved by a quantum computer), the functionality of verification asks 'Does every problem in BQP admit an interactive-proof system in which the prover is restricted to BQP computations?' The example protocol answers this question by defining quantum prover interactive proofs and state 'Any language in BQP has a QPIP which hides the computation from the prover'. IP (interactive proof systems) is a generalisation of class MA, which involves multiple interaction between the prover (untrusted company) and the verifier (consumer).