Fetching the paper…
Reading the bibliography…
We show that a form of strong simulation for $n$-qubit quantum stabilizer circuits $C$ is computable in $O(s + n^\omega)$ time, where $\omega$ is the exponent of matrix multiplication.
Symmetric and alternate matrices in an arbitrary field, I
A. Albert · 1938
Earlier work this paper cites.
Gaussian elimination is not optimal
V. Strassen · 1969
Earlier work this paper cites.
Generalizations of the Kervaire invariant
Edgar H Brown · 1972
Earlier work this paper cites.
The computational complexity of (XOR, AND)-counting problems
A. Ehrenfeucht and M. Karpinski · 1990
Earlier work this paper cites.
A characterization of Tutte invariants of 2-polymatroids
J. Oxley and G. Whittle · 1993
Earlier work this paper cites.
The Heisenberg representation of quantum computers
D. Gottesman · 1998
Earlier work this paper cites.
The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
J. Dehaene and B.L.R. De Moor · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
S. Aaronson and D. Gottesman · 2004
Earlier work this paper cites.
Quantum computing and polynomial equations over the finite field Z 2 Z_{2}
C. Dawson, H. Haselgrove, A. Hines, D. Mortimer, M. Nielsen, and T. Osborne · 2004
Earlier work this paper cites.
Fast simulation of stabilizer circuits using a graph state representation
S. Anders and H. Briegel · 2006
Earlier work this paper cites.
Evaluating the rank generating function of a graphic 2-polymatroid
S. Noble · 2006
Earlier work this paper cites.
Analyzing algebraic quantum circuits using exponential sums
D. Bacon, W. van Dam, and A. Russell · 2008
Earlier work this paper cites.
Quantum circuits, polynomials, and entanglement measures, 2009
K. Regan and A. Chakrabarti · 2009
Earlier work this paper cites.
Z 4 Z_{4} -valued quadratic forms and quaternary sequence families
Kai-Uwe Schmidt · 2009
Cited alongside, same era.
Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond, 2009
M. van den Nest · 2009
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
M. Bremner, R. Jozsa, and D. Shepherd · 2010
Cited alongside, same era.
On tractable exponential sums
J.-Y. Cai, X. Chen, R. Lipton, and P. Lu · 2010
Cited alongside, same era.
On the Complexity of Matrix Multiplication
A. Stothers · 2010
Cited alongside, same era.
Multiplying matrices faster than Coppersmith-Winograd
Improved classical simulation of quantum circuits dominated by Clifford gates
S. Bravyi and D. Gosset · 2016
Later among the works it cites.
A new holant dichotomy inspired by quantum computation
M. Backens · 2017
Later among the works it cites.
Simulation of quantum circuits via stabilizer frames
H. García and I.L. Markov · 2017
Later among the works it cites.
Further extensions of Clifford circuits and their classical simulation complexities
D. Koh · 2017
Later among the works it cites.
Computing quopit Clifford circuit amplitudes by the sum-over-paths technique
D.E. Koh, M.D. Penney, and R.W. Spekkens · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V.V. Williams · 2012
Cited alongside, same era.
Fast matrix rank algorithms and applications
H.Y. Cheung, T.C. Kwok, and L.C. Lau · 2013
Cited alongside, same era.
Quipu: High-performance simulation of quantum circuits using stabilizer frames
H. García and I.L. Markov · 2013
Cited alongside, same era.
The complexity of complex weighted Boolean #CSP
J.-Y. Cai, P. Lu, and M. Xia · 2014
Cited alongside, same era.
Powers of tensors and fast matrix multiplication
F. Le Gall · 2014
Cited alongside, same era.
On the geometry of stabilizer states
H. García, I.L. Markov, and A.W. Cross · 2014
Cited alongside, same era.
Classical simulation complexity of extended Clifford circuits
R. Jozsa and M. van den Nest · 2014
Cited alongside, same era.
A. Montanaro · 2017
Later among the works it cites.
A complete dichotomy for complex-valued Holant c
M. Backens · 2018
Later among the works it cites.
Classical simulation of quantum circuits by half Gauss sums
K. Bu and D. koh · 2018
Later among the works it cites.
Clifford gates in the holant frameqwork
Jin-Yi Cai, Heng Guo, and Tyson Williams · 2018
Later among the works it cites.
Symmetric indefinite triangular factorization revealing the rank profile matrix
J.-G. Dumas and C. Pernet · 2018
Later among the works it cites.
Quantum supremacy is both closer and farther than it appears
I. Markov, A. Fatima, S. Isakov, and S. Boixo · 2018
Later among the works it cites.
Algebraic and logical emulations of quantum circuits
K. Regan, A. Chakrabarti, and C. Guan · 2018
Later among the works it cites.
Simulation of quantum circuits by low-rank stabilizer decompositions
S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard · 2019
Closest in time.