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

@article{Huang2019ExplicitLB, title={Explicit lower bounds on strong simulation of quantum circuits in terms of \$T\$-gate count}, author={Cupjin Huang and Michael Newman and Mario Szegedy}, journal={ArXiv}, year={2019}, volume={abs/1902.04764} }

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.

#### Paper Mentions

BLOG POST

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

## Depth-scaling fine-grained quantum supremacy based on SETH and qubit-scaling fine-grained quantum supremacy based on Orthogonal Vectors and 3-SUM

VIEW 4 EXCERPTS

CITES BACKGROUND & RESULTS

HIGHLY INFLUENCED

## Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths.

VIEW 3 EXCERPTS

CITES METHODS & BACKGROUND

## Fine-grained quantum computational supremacy

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## Fine-grained quantum computational supremacy

VIEW 1 EXCERPT