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.
Cite
@article{arxiv.1012.5699,
title = {Interactive proofs with efficient quantum prover for recursive Fourier sampling},
author = {Matthew McKague},
journal= {arXiv preprint arXiv:1012.5699},
year = {2011}
}