Corpus ID: 61153500

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}
}
  • Cupjin Huang, Michael Newman, Mario Szegedy
  • Published 2019
  • Mathematics, Physics, Computer Science
  • ArXiv
  • 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. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    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

    Quantum computation and quantum information

    • Thierry Paul
    • Computer Science, Mathematics
    • Math. Struct. Comput. Sci.
    • 2007

    Which problems have strongly exponential complexity?

    3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

    • Timon Hertli
    • Mathematics, Computer Science
    • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
    • 2011