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

Cupjin Huang; Michael Newman; Mario Szegedy

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

Quantum Physics 2019-02-26 v2 Computational Complexity

Authors: Cupjin Huang , Michael Newman , Mario Szegedy

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.

Keywords

quantum circuits strong simulation clifford+t t-gate count lower bounds sparsification lemma

Cite

@article{arxiv.1902.04764,
  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 preprint arXiv:1902.04764},
  year   = {2019}
}

Comments

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

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

Abstract

Keywords

Cite

Comments

Related papers