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

Abstract

We investigate Clifford+$T$ quantum circuits with a small number of $T$-gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of $T$-gate count below which a strong simulator would improve on the state-of-the-art $3$-SAT solving.

Combined with arxiv:1804.10368 and submitted for publication. Similar results have been obtained recently in arxiv:1901.01637 independently

Cited by in corpus (1)

• Sampling of globally depolarized random quantum circuit