Computational complexity and 3-manifolds and zombies
Greg Kuperberg (UC Davis), Eric Samperton (UC Davis)

TL;DR
This paper proves the computational hardness of counting and deciding homomorphisms from the fundamental group of 3-manifolds to finite simple groups, linking topological complexity with quantum computation-inspired constructions.
Contribution
It establishes #P-completeness and NP-completeness results for homomorphism counting and existence problems in 3-manifold topology, using constructions inspired by topological quantum computation.
Findings
Counting homomorphisms is #P-complete.
Deciding non-trivial homomorphisms is NP-complete.
Connected m-sheeted coverings decision is NP-complete for fixed m ≥ 5.
Abstract
We show the problem of counting homomorphisms from the fundamental group of a homology -sphere to a finite, non-abelian simple group is #P-complete, in the case that is fixed and is the computational input. Similarly, deciding if there is a non-trivial homomorphism is NP-complete. In both reductions, we can guarantee that every non-trivial homomorphism is a surjection. As a corollary, for any fixed integer , it is NP-complete to decide whether admits a connected -sheeted covering. Our construction is inspired by universality results in topological quantum computation. Given a classical reversible circuit , we construct so that evaluations of with certain initialization and finalization conditions correspond to homomorphisms . An intermediate state of likewise corresponds to a homomorphism , where…
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.
