Towards a complexity-theoretic dichotomy for TQFT invariants
By: Nicolas Bridges, Eric Samperton
Potential Business Impact:
Solves math puzzles about shapes or makes them impossible.
We show that for any fixed $(2+1)$-dimensional TQFT over $\mathbb{C}$ 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 $\#\mathsf{P}$-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 $\mathbb{C}$. We leave for future work the issue of reinterpreting the conditions of Cai and Chen that distinguish between the two cases (i.e. $\#\mathsf{P}$-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 the TQFT's fusion category.
Similar Papers
Hardness of computation of quantum invariants on 3-manifolds with restricted topology
Geometric Topology
Makes computers understand tricky shapes better.
The finiteness conjecture for $3 \times 3$ binary matrices
Numerical Analysis
Proves math problems automatically, making computers smarter.
An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
Computational Complexity
Makes hard computer problems harder to solve.