Explicit lower bounds on strong simulation of quantum circuits in terms of T-gate count
classification
🪐 quant-ph
cs.CC
keywords
boundscircuitscountgatelowerquantumstrongterms
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.