Interactive proofs with efficient quantum prover for recursive Fourier sampling

Abstract

We consider the recursive Fourier sampling problem (RFS), and show that there exists an interactive proof for RFS with an efficient classical verifier and efficient quantum prover.

Cited by in corpus (2)

• Interactive proofs for BQP via self-tested graph states
• Interactive proofs for BQP via self-tested graph states (extended abstract)