Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count

Built on

A probabilistic algorithm for k-SAT and constraint satisfaction problems
Original
T Schoning · 1902
Earlier work this paper cites.
Logical reversibility of computation
Bennett, Charles H · 1973
Earlier work this paper cites.
Satisfiability coding lemma
Ramamohan Paturi, Pavel Pudlák, and Francis Zane · 1997
Earlier work this paper cites.
Which problems have strongly exponential complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 2001
Earlier work this paper cites.

Quantum computation and quantum information, 2002
Michael A Nielsen and Isaac Chuang · 2002
Cited alongside, same era.
An improved exponential-time algorithm for k-SAT
Ramamohan Paturi, Pavel Pudlák, Michael E Saks, and Francis Zane · 2005
Cited alongside, same era.
3-SAT Faster and Simpler—Unique-SAT Bounds for PPSZ Hold in General
Timon Hertli · 2014
Cited alongside, same era.

Improved classical simulation of quantum circuits dominated by Clifford gates
Sergey Bravyi and David Gosset · 2016
Later among the works it cites.
Simulation of quantum circuits by low-rank stabilizer decompositions
Original
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2018
Later among the works it cites.
Fine-grained quantum computational supremacy
Original
Tomoyuki Morimae and Suguru Tamaki · 2019
Closest in time.