A common argument for quantum computational "supremacy" assumes that there exists a classical sampler that outputs a probability $q_x$, $x \in \{0,1\}^{2^n}$ that approximates an output probability $p_x$ of a quantum device up to an additive error, then uses Stockmeyer's counting to improve $q_x$...