Interactive proofs with efficient quantum prover for recursive Fourier sampling
Matthew McKague
TL;DR
This paper presents an interactive proof system for the recursive Fourier sampling problem, enabling an efficient classical verifier to interact with an efficient quantum prover, advancing quantum verification methods.
Contribution
It introduces an interactive proof protocol for RFS with an efficient classical verifier and quantum prover, a novel approach in quantum complexity theory.
Findings
Existence of an interactive proof for RFS with efficient quantum prover
Classical verifier remains efficient in the protocol
Advances quantum verification techniques
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Machine Learning and Algorithms · Advanced Bandit Algorithms Research