Fetching the paper…
Reading the bibliography…
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically.
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 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.
Resilient Quantum Computation
E. Knill, R. Laflamme, and W.H. Zurek · 1998
Earlier work this paper cites.
Space-Bounded Quantum Complexity
J. Watrous · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
M.A. Nielsen, I. Chuang, and L.K. Grover · 2000
Earlier work this paper cites.
Secure assisted quantum computation
A.M. Childs · 2001
Earlier work this paper cites.
Authentication of Quantum Messages
H. Barnum, C. Crépeau, D. Gottesman, A. Smith, and A. Tapp · 2002
Cited alongside, same era.
Blind Analysis in Particle Physics
A. Roodman · 2003
Cited alongside, same era.
PSPACE has constant-round quantum interactive proof systems
J. Watrous · 2003
Cited alongside, same era.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Cited alongside, same era.
The BQP-hardness of approximating the Jones Polynomial
D. Aharonov and I. Arad · 2006
Cited alongside, same era.
A polynomial quantum algorithm for approximating the Jones polynomial
D. Aharonov, V. Jones, and Z. Landau · 2006
Cited alongside, same era.
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
M. Ben-Or, C. Crépeau, D. Gottesman, A. Hassidim, and A. Smith · 2006
Later among the works it cites.
Quantum t-designs: t-wise independence in the quantum world
A. Ambainis and J. Emerson · 2007
Later among the works it cites.
Computational constraints on scientific theories: insights from quantum computing
U. Vazirani · 2007
Later among the works it cites.
Tamper-resistant encryption of quantum information
A. Ambainis, J. Bouda, and A. Winter · 2008
Closest in time.
Universal blind quantum computation
A. Broadbent, J. Fitzsimons, and E. Kashefi · 2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Arrighi and L. Salvail · 2006
Cited alongside, same era.
Computational Complexity: A Modern Approach
S. Arora and B. Barak
Cited in the paper.
Wikipedia · 2008
Closest in time.
Preprint: Interactive Proofs as a Theory of Confirmation
Jonathan Yaari · 2008
Closest in time.