Document Open Access Logo

Towards a Complexity-Theoretic Dichotomy for TQFT Invariants

Authors Nicolas Bridges , Eric Samperton

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.TQC.2025.5.pdf
  • Filesize: 1.04 MB
  • 21 pages
HTML5 Logo HTML (experimental)
LIPIcs.TQC.2025.5.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Geometric topology
  • Theory of computation → Problems, reductions and completeness
  • Theory of computation → Quantum complexity theory
Keywords
  • Complexity
  • topological quantum field theory
  • dichotomy theorems
  • constraint satisfaction problems
  • tensor categories

Metrics

Abstract

We show that for any fixed (2+1)-dimensional TQFT over ℂ of either Turaev-Viro-Barrett-Westbury or Reshetikhin-Turaev type, the problem of (exactly) computing its invariants on closed 3-manifolds is either solvable in polynomial time, or else it is #𝖯-hard to (exactly) contract certain tensors that are built from the TQFT’s fusion category. Our proof is an application of a dichotomy result of Cai and Chen [J. ACM, 2017] concerning weighted constraint satisfaction problems over ℂ. We leave for future work the issue of reinterpreting the conditions of Cai and Chen that distinguish between the two cases (i.e. #𝖯-hard tensor contractions vs. polynomial time invariants) in terms of fusion categories. We expect that with more effort, our reduction can be improved so that one gets a dichotomy directly for TQFTs' invariants of 3-manifolds rather than more general tensors built from TQFTs' fusion categories.

Cite As Get BibTex

Nicolas Bridges and Eric Samperton. Towards a Complexity-Theoretic Dichotomy for TQFT Invariants. In 20th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 350, pp. 5:1-5:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.TQC.2025.5

Author Details

Nicolas Bridges
  • Department of Mathematics, Purdue University, West Lafayette, IN, USA
Eric Samperton
  • Departments of Mathematics and Computer Science, Purdue University, West Lafayette, IN, USA

Funding

Both authors supported in part by NSF CCF grant 2330130.

References

  1. Rhuaidi Antonio Burke. Practical Software for Triangulating and Simplifying 4-Manifolds. In Wolfgang Mulzer and Jeff M. Phillips, editors, 40th International Symposium on Computational Geometry (SoCG 2024), volume 293 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1-29:23, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2024.29.
  2. Jin-Yi Cai and Xi Chen. Complexity of counting CSP with complex weights. Journal of the ACM (JACM), 64(3):1-39, 2017. Google Scholar
  3. Jin-Yi Cai, Pinyan Lu, and Mingji Xia. Computational complexity of holant problems. SIAM Journal on Computing, 40(4):1101-1132, 2011. Google Scholar
  4. Louis Crane and Louis H Kauffman. Evaluating the crane-yetter invariant. Quantum topology, 3:131-8, 1993. Google Scholar
  5. Louis Crane and David N Yetter. A categorical construction of 4d tqfts. arXiv preprint hep-th/9301062, 1993. Google Scholar
  6. Shawn X Cui and Zhenghan Wang. Universal quantum computation with metaplectic anyons. Journal of Mathematical Physics, 56(3), 2015. Google Scholar
  7. Colleen Delaney, Clément Maria, and Eric Samperton. An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number. In Oswin Aichholzer and Haitao Wang, editors, 41st International Symposium on Computational Geometry (SoCG 2025), volume 332 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:15, Dagstuhl, Germany, 2025. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SoCG.2025.38.
  8. Christopher L Douglas and David J Reutter. Fusion 2-categories and a state-sum invariant for 4-manifolds. arXiv preprint arXiv:1812.11933, 2018. Google Scholar
  9. Michael H Freedman, Alexei Kitaev, and Zhenghan Wang. Simulation of topological field theories by quantum computers. Communications in Mathematical Physics, 227:587-603, 2002. Google Scholar
  10. Michael H Freedman, Michael Larsen, and Zhenghan Wang. A modular functor which is universal for quantum computation. Communications in Mathematical Physics, 227:605-622, 2002. Google Scholar
  11. Robion Kirby and Paul Melvin. Local surgery formulas for quantum invariants and the Arf invariant. Geometry & Topology Monographs, 7, 2004. Google Scholar
  12. Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics, 321(1):2-111, 2006. Google Scholar
  13. Greg Kuperberg. How hard is it to approximate the Jones polynomial? Theory of Computing, 11(6):183-219, 2015. Google Scholar
  14. Greg Kuperberg and Eric Samperton. Computational complexity and 3-manifolds and zombies. Geometry & Topology, 22(6):3623-3670, 2018. Google Scholar
  15. Greg Kuperberg and Eric Samperton. Coloring invariants of knots and links are often intractable. Algebraic & Geometric Topology, 21(3):1479-1510, 2021. Google Scholar
  16. Richard E Ladner. On the structure of polynomial time reducibility. Journal of the ACM (JACM), 22(1):155-171, 1975. Google Scholar
  17. Deepak Naidu and Eric C Rowell. A finiteness property for braided fusion categories. Algebras and representation theory, 14:837-855, 2011. Google Scholar
  18. David Reutter. Uniqueness of unitary structure for unitarizable fusion categories. Comm. Math. Phys., 397(1):37-52, 2023. URL: https://doi.org/10.1007/s00220-022-04425-7.
  19. Eric Rowell and Zhenghan Wang. Mathematics of topological quantum computing. Bulletin of the American Mathematical Society, 55(2):183-238, 2018. Google Scholar
  20. Eric Samperton. Topological quantum computation is hyperbolic. Communications in Mathematical Physics, 402(1):79-96, 2023. Google Scholar
  21. Thomas J Schaefer. The complexity of satisfiability problems. In Proceedings of the tenth annual ACM symposium on Theory of computing, pages 216-226, 1978. Google Scholar
  22. Leslie G Valiant. Holographic algorithms. SIAM Journal on Computing, 37(5):1565-1594, 2008. Google Scholar
  23. Zhenghan Wang. Topological quantum computation, volume 112 of CBMS Regional Conference Series in Mathematics. Conference Board of the Mathematical Sciences, Washington, DC; by the American Mathematical Society, Providence, RI, 2010. URL: https://doi.org/10.1090/cbms/112.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact