Skeleton of isometric Tensor Network States for Abelian String-Net Models
Julian Boesl, Yu-Jie Liu, Frank Pollmann, Michael Knap
TL;DR
The work constructs skeletons of isometric tensor-network states (isoTNS) for abelian string-net models, enabling efficient quantum preparation and tractable classical evaluation of many observables through mapping to stochastic automata. By enforcing virtual symmetries and isometry, the authors connect fixed-point topological orders via analytically tractable, continuous deformations, revealing phase transitions beyond anyon condensation. They demonstrate explicit isoTNS paths linking $Z_N$ toric codes, double-semion, and symmetry-enriched orders, and show how generalized Pauli strings up to arbitrary weight can be computed classically in many cases. The framework provides a versatile, testable platform for benchmarking quantum processors and exploring a rich landscape of topological and SET phases with finite correlation length. It also highlights how extending to higher multipole-conserving processes yields new critical behaviors and deeper connections between stochastic dynamics and topological order.
Abstract
We construct parametrized isometric tensor network states -- referred to as skeletons -- that allow us to explore phases of abelian topological order and can be efficiently implemented on quantum processors. We obtain stable finite correlation length deformations of string-net fixed points, which are constructed both by conserving virtual symmetries of the tensor and by imposing local isometry constraints. They connect distinct topological phases via a shared critical point, thereby providing analytically tractable examples of phase transitions beyond anyon condensation. By mapping such classes of 2D tensor networks to 1D stochastic automata with local update rules, we show that expectation values of generalized Pauli strings of arbitrary weight can be efficiently computed using classical methods. Therefore these skeletons not only serve as an organizing principle for abelian topological order but also provide a non-trivial testbed for quantum processors.
