Quantum invariants in low-dimensional topology offer a wide variety of valuable invariants about knots and 3-manifolds, presented by explicit formulas that are readily computable. Their computational complexity has been actively studied and is tightly connected to topological quantum computing. In this article, we prove that for any 3-manifold quantum invariant in the Reshetikhin-Turaev model, there is a deterministic polynomial time algorithm that, given as input an arbitrary closed 3-manifold M, outputs a closed 3-manifold M' with the same quantum invariant, such that M' is hyperbolic, contains no low genus embedded incompressible surface, and is presented by a strongly irreducible Heegaard diagram. Our construction relies on properties of Heegaard splittings and the Hempel distance. At the level of computational complexity, this proves that the hardness of computing a given quantum invariant of 3-manifolds is preserved even when severely restricting the topology and the combinatorics of the input. This positively answers a question raised by Samperton [Samperton, 2023].
@InProceedings{ennes_et_al:LIPIcs.ESA.2025.37, author = {Ennes, Henrique and Maria, Cl\'{e}ment}, title = {{Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted Topology}}, booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)}, pages = {37:1--37:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-395-9}, ISSN = {1868-8969}, year = {2025}, volume = {351}, editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.37}, URN = {urn:nbn:de:0030-drops-245057}, doi = {10.4230/LIPIcs.ESA.2025.37}, annote = {Keywords: 3-manifold, Heegaard splitting, Hempel distance, Quantum invariant, polynomial time reduction} }
Feedback for Dagstuhl Publishing