Published by the Department of Computer Science, The University of Chicago.
Interactive proofs with efficient quantum prover for recursive Fourier sampling
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.
- The article: PDF (188 Kbytes)
- Source material: ZIP (29 Kbytes)
- BibTeX entry for this article (299 bytes)
Submitted August 24, 2011, revised May 21, 2012, and in September 18, 2012, published September 21, 2012.
Volume 2012, Article 5
Volume 2012, Article 7