Classical Simulations of Near-Term Quantum Algorithms

The classical simulation of quantum circuits is generically a hard problem. However, there are algorithms that either exactly or approximately simulate quantum circuits that satisfy certain conditions. These classically reachable regimes include the set of Clifford circuits, Matchgate circuits, shallow circuits in 1D, circuits with low treewidth, and a few other scenarios. In this talk I will introduce an algorithm that attempts at approximating the weak simulation of shallow circuits beyond 1D.