Name
Title | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Quantum Physics | Journal |
Volume | Citations | PageRank |
abs/1902.04764 | 1 | 0.38 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cupjin Huang | 1 | 4 | 1.13 |
| Michael Newman | 2 | 838 | 91.96 |
| Mario Szegedy | 3 | 3358 | 325.80 |