Fetching the paper…
Reading the bibliography…
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation.
New bounds in some transference theorems in the geometry of numbers
Wojciech Banaszczyk · 1993
Earlier work this paper cites.
Classical and Quantum Computation
A.Y. Kitaev, A. Shen, and M.N. Vyalyi · 2002
Earlier work this paper cites.
Both toffoli and controlled-not need little help to do universal quantum computing
Yaoyun Shi · 2003
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Earlier work this paper cites.
Realizable hamiltonians for universal adiabatic quantum computers
Jacob D. Biamonte and Peter J. Love · 2008
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Earlier work this paper cites.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009
Earlier work this paper cites.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Cited alongside, same era.
Robustness of the learning with errors assumption
Shafi Goldwasser, Yael Kalai, Chris Peikert, and Vinod Vaikuntanathan · 2010
Cited alongside, same era.
Trapdoors for lattices: Simpler, tighter, faster, smaller
Daniele Micciancio and Chris Peikert · 2011
Cited alongside, same era.
Learning with rounding, revisited: New reduction, properties and applications
Joel Alwen, Stephan Krenn, Krzysztof Pietrzak, and Daniel Wichs · 2013
Cited alongside, same era.
Classical hardness of learning with errors
Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehl · 2013
Cited alongside, same era.
A classical leash for a quantum system: Command of quantum systems via rigidity of chsh games
Ben W. Reichardt, Falk Unger, and Umesh Vazirani · 2013
Post hoc verification with a single prover
Tomoyuki Morimae and Joseph F. Fitzsimons · 2016
Later among the works it cites.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev · 2017
Later among the works it cites.
Unconditionally verifiable blind quantum computation
Joseph F. Fitzsimons and Elham Kashefi · 2017
Later among the works it cites.
As referenced in [ http://www.scottaaronson.com/blog/?p=284 ; accessed 13-Apr-2017]
Daniel Gottesman, 2004 · 2017
Later among the works it cites.
Classical homomorphic encryption for quantum circuits
Urmila Mahadev · 2018
Closest in time.
Trace distance — Wikipedia, the free encyclopedia, 2018
Wikipedia · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Quantum proofs can be verified using only single qubit measurements, 2015
Tomoyuki Morimae, Daniel Nagaj, and Norbert Schuch · 2015
Cited alongside, same era.
A cryptographic test of quantumness and certifiable randomness from a single quantum device
Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh Vazirani, and Thomas Vidick · 2021
Closest in time.