A Complexity Dichotomy for Quantum Invariants of 3-Manifolds
C\'sar Galindo

TL;DR
This paper establishes precise complexity classifications for computing two quantum invariants of 3-manifolds, showing when these computations are feasible or computationally hard based on categorical properties.
Contribution
It provides exact dichotomies for the computational complexity of Reshetikhin--Turaev and Turaev--Viro invariants, linking complexity to categorical data and introducing a genus-one graph family for reductions.
Findings
Computing Reshetikhin--Turaev invariant is in FP iff the category is pointed.
Computing Turaev--Viro invariant is in FP iff the Drinfeld center is pointed.
Otherwise, both invariants are -hard.
Abstract
We prove exact complexity dichotomies for two quantum invariants of closed oriented three-manifolds, with the categorical data fixed. For a modular category , computing the Reshetikhin--Turaev invariant from a framed-link surgery presentation is in exactly when is pointed, that is, when all simple objects are invertible under tensor product; otherwise it is -hard. For a spherical fusion category , computing the Turaev--Viro invariant from a triangulation, equivalently from a skeleton, is in exactly when its Drinfeld center is pointed, equivalently when is trivializable pointed; otherwise it is -hard. The polynomial-time cases reduce to finite abelian linear algebra and Gauss sums. The reductions are based on a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
