Fetching the paper…
Reading the bibliography…
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.
IP = PSPACE
Adi Shamir · 1992
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
Quantum lower bound for recursive Fourier sampling
Scott Aaronson · 2003
Earlier work this paper cites.
Self testing quantum apparatus
Dominic Mayers and Andrew Yao · 2004
Cited alongside, same era.
Self-testing of quantum circuits
Frédéric Magniez, Dominic Mayers, Michele Mosca, and Harold Ollivier · 2006
Cited alongside, same era.
Interactive proofs for quantum computations, October 2008
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2008
Cited alongside, same era.
Superpolynomial speedups based on almost any quantum circuit
Sean Hallgren and Aram Harrow · 2008
Later among the works it cites.
Upper and Lower Bounds for Recursive Fourier Sampling
Benjamin Johnson · 2008
Later among the works it cites.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…