Interactive Proofs for Quantum Computation
Jump to navigation
Jump to search
'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'