2010/12/28 by Matthew McKague, McKague, Matthew
Computer Science · Decision Sciences · Physics and Astronomy · #Advanced Algebra and Logic #Advanced Bandit Algorithms Research #Blind Source Separation Techniques #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Machine Learning and Algorithms #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #cs.CC #quant-ph
paper · pdf · doi:10.48550/arxiv.1012.5699
openalex publication_date 2010/12/28 · arxiv created 2011/08/24 · arxiv updated 2011/08/25 · openalex created_date 2022/08/29 · openalex updated_date 2026/07/28
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.