期刊名称:Chicago Journal of Theoretical Computer Science
印刷版ISSN:1073-0486
出版年度:2012
卷号:2012
出版社:MIT Press ; University of Chicago, Department of Computer Science
摘要:
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.