Fetching the paper…
Reading the bibliography…
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (CT) states and efficiently computable sparse (ECS) operations.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Computational complexity of uniform quantum circuit families and quantum Turing machines
H. Nishimura and M. Ozawa · 2002
Earlier work this paper cites.
Adaptive quantum computation, constant-depth quantum circuits and Arthur-Merlin games
B. M. Terhal and D. P. DiVincenzo · 2004
Earlier work this paper cites.
Bounds on the power of constant-depth quantum circuits
S. Fenner, F. Green, S. Homer, and Y. Zhang · 2005
Earlier work this paper cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
M. J. Bremner, R. Jozsa, and D. J. Shepherd · 2011
Earlier work this paper cites.
Simulating quantum computers with probabilistic methods
M. van den Nest · 2011
Earlier work this paper cites.
The computational complexity of linear optics
S. Aaronson and A. Arkhipov · 2013
Cited alongside, same era.
Simulating quantum circuits with sparse output distributions, 2013
M. Schwarz and M. van den Nest · 2013
Cited alongside, same era.
Analysis of Boolean Functions
R. O’Donnell · 2014
Cited alongside, same era.
Average-case complexity versus approximate simulation of commuting quantum computations
M. J. Bremner, A. Montanaro, and D. J. Shepherd · 2016
Cited alongside, same era.
Computational quantum-classical boundary of noisy commuting quantum circuits
K. Fujii and S. Tamate · 2016
Cited alongside, same era.
Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Y. Takeuchi and Y. Takahashi · 2016
Quantum computational supremacy
A. W. Harrow and A. Montanaro · 2017
Later among the works it cites.
Further extensions of Clifford circuits and their classical simulation complexities
D. E. Koh · 2017
Later among the works it cites.
Architectures for quantum simulation showing a quantum speedup
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert · 2018
Later among the works it cites.
Complexity classification of conjugated Clifford circuits
A. Bouland, J. F. Fitzsimons, and D. E. Koh · 2018
Later among the works it cites.
Efficient classical simulation of noisy quantum computation, 2018
X. Gao and L. Duan · 2018
Later among the works it cites.
Efficient classical simulation of Clifford circuits with nonstabilizer input states
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Achieving quantum supremacy with sparse and noisy commuting quantum computations
M. J. Bremner, A. Montanaro, and D. J. Shepherd · 2017
Cited alongside, same era.
K. Bu and D. E. Koh · 2019
Later among the works it cites.
Quantum advantage of unitary Clifford circuits with magic state inputs
M. Yoganathan, R. Jozsa, and S. Strelchuk · 2019
Later among the works it cites.