Fetching the paper…
Reading the bibliography…
The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics falsifiable? In cryptographic settings, how can a customer of a future untrusted quantum computing company be convinced of the correctness of its quantum computations? To provide answers to these questions, we define Quantum Prover Interactive Proofs (QPIP).
The knowledge complexity of interactive proof-systems
S. Goldwasser, S. Micali, and C. Rackoff · 1985
Earlier work this paper cites.
On hiding information from an oracle
M. Abadi, J. Feigenbaum, and J. Kilian · 1987
Earlier work this paper cites.
Fault-tolerant quantum computation
P. Shor · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
PW Shor · 1997
Earlier work this paper cites.
Secure assisted quantum computation
A.M. Childs · 2001
Earlier work this paper cites.
Topological Quantum Computation
M. Freedman, A. Kitaev, M. Larsen, and Z. Wang · 2001
Earlier work this paper cites.
Authentication of Quantum Messages
H. Barnum, C. Crépeau, D. Gottesman, A. Smith, and A. Tapp · 2002
Earlier work this paper cites.
Quantum data hiding
D. DiVincenzo, D.W. Leung, and B.M. Terhal · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A.Y. Kitaev, A. Shen, and M.N. Vyalyi · 2002
Earlier work this paper cites.
Blind Analysis in Particle Physics
A. Roodman · 2003
Earlier work this paper cites.
PSPACE has constant-round quantum interactive proof systems
J. Watrous · 2003
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Earlier work this paper cites.
The BQP-hardness of approximating the Jones Polynomial
D. Aharonov and I. Arad · 2006
Earlier work this paper cites.
A polynomial quantum algorithm for approximating the Jones polynomial
D. Aharonov, V. Jones, and Z. Landau · 2006
Earlier work this paper cites.
Blind Quantum Computation
P. Arrighi and L. Salvail · 2006
Earlier work this paper cites.
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
M. Ben-Or, C. Crépeau, D. Gottesman, A. Hassidim, and A. Smith · 2006
Earlier work this paper cites.
Quantum t-designs: t-wise independence in the quantum world
A. Ambainis and J. Emerson · 2007
Cited alongside, same era.
Talk given in a conference in Japan
Umesh Vazirani, 2007 · 2007
Cited alongside, same era.
Interactive Proofs For Quantum Computations
D. Aharonov, M. Ben-Or, and E. Eban · 2008
Cited alongside, same era.
Tamper-resistant encryption of quantum information
A. Ambainis, J. Bouda, and A. Winter · 2008
Cited alongside, same era.
Universal blind quantum computation
A. Broadbent, J. Fitzsimons, and E. Kashefi · 2008
Cited alongside, same era.
Demonstration of measurement-only blind quantum computing
S. Barz, J.F. Fitzsimons, E. Kashefi, and P. Walther · 2013
Later among the works it cites.
Interactive proofs for BQP via self-tested graph states
M. Mckague · 2013
Later among the works it cites.
Quantum homomorphic encryption for circuits of low T-gate complexity
A. Broadbent and S. Jeffery · 2014
Later among the works it cites.
Verification for measurement-only blind computation
T. Morimae · 2014
Later among the works it cites.
Limitations on information theoretically secure quantum homomorphic encryption
L. Yu, C. Perez-Delgado, and J. Fitzsimons · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Wikipedia · 2008
Cited alongside, same era.
Preprint: Interactive Proofs as a Theory of Confirmation
Jonathan Yaari · 2008
Cited alongside, same era.
BQP and the Polynomial Hierarchy
S. Aaronson · 2009
Cited alongside, same era.
Computational Complexity: A Modern Approach
S. Arora and B. Barak · 2009
Cited alongside, same era.
Approximate Counting and Quantum Computation
M. Bordewich, M. Freedman, L. Lovász, and D. Welsh · 2009
Cited alongside, same era.
D. Aharonov and U. Vazirani · 2012
Cited alongside, same era.
A. Broadbent, G. Gutoski, and D. Stebila · 2012
Cited alongside, same era.
A. Broadbent · 2015
Later among the works it cites.
Robustness and device independence of verifiable blind quantum computing
A. Gheorghiu, E. Kashefi, and P. Wallden · 2015
Later among the works it cites.
Verifiable Measurement-Only Blind Quantum Computating with Stabilizer Testing
M. Hayashi and T. Morimae · 2015
Later among the works it cites.
Device-Independent Verifiable Blind Quantum Computation
M. Hajdušek, C. Pérez-Delgado, and J. Fitzsimons · 2015
Later among the works it cites.
Quantum homomorphic encryption for polynomial-sized circuits
Y. Dulek, C. Schaffner, and F. Speelman · 2016
Later among the works it cites.
Demonstration of measurement-only blind quantum computing
C. Greganti, MC. Roehsner, s. Barz, T. Morimae, and P. Walther · 2016
Later among the works it cites.
Self-guaranteed measurement-based quantum computation
M. Hayashi and M. Hajdušek · 2016
Later among the works it cites.
Post hoc verification with a single prover
T. Morimae and J. Fitzsimons · 2016
Later among the works it cites.
Practically verifiable blind quantum computation with acceptance rate amplification
Y. Takeuchi, K. Fujii, T. Morimae, and N. Imoto · 2016
Later among the works it cites.
Blind or verifiable fault tolerant delegated quantum computation
D. Aharonov, F. Song, U. Mahadev, and J. Zhengfeng · 2017
Closest in time.
As referenced in [ http://www.scottaaronson.com/blog/?p=284 ; accessed 13-Apr-2017]
Daniel Gottesman, 2004 · 2017
Closest in time.