Chicago Journal of Theoretical Computer Science

Volume 2012

Article 6

Published by the Department of Computer Science, The University of Chicago.

Interactive proofs with efficient quantum prover for recursive Fourier sampling

Matthew McKague
Centre for Quantum Technologies
National University of Singapore

September 21, 2012


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.

Submitted August 24, 2011, revised May 21, 2012, and in September 18, 2012, published September 21, 2012.

DOI: 10.4086/cjtcs.2012.006

[] Volume 2012, Article 5 [] Volume 2012, Article 7
[back] Volume 2012 [back] Published articles
[CJCTS home]