Zesting and the relative complexity of Reshetikhin-Turaev invariants
with Calvin McPhail-Snyder, arXiv:2608.02795
We show that there is a polynomial-time Turing equivalence of the Reshetikhin-Turaev invariants of simply-colored framed links whose underlying ribbon fusion categories are related by zesting. Along the way we give a characterization of the zest invariant of a link as a rack cocycle invariant, which shows that zesting "twists" TQFT link invariants by "classical" link invariants familiar from knot theory. Applied to unitary modular fusion categories, our results give a precise sense in which the anyons of topological orders related by zesting generate the same computational complexity.