Interactive proofs with efficient quantum prover for recursive Fourier sampling
classification
🪐 quant-ph
cs.CC
keywords
efficientfourierinteractiveproverquantumrecursivesamplingclassical
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.