Manuscripts that did not cross my arXiv threshold, but might still be of interest to some.
–> Proves a conditional lower bound for strong Clifford+T simulation. The bound is conditioned on exact runtimes of 3-SAT not improving past O^*(1.3^n). This has been done before in the literature, we slightly improve the lower bound by tightening existing prove techniques.