Establishing a universal diagnostic of topological order remains an open theoretical challenge. In particular, diagnosing long-range entanglement through the entropic area law suffers from spurious contributions, failing to unambiguously identify topological order. Here we devise a protocol based on the ZX calculus, a graphical tensor network, to determine the topological order of a state circumventing entropy calculations. The protocol takes as input real-space bipartitions of a state and returns a ZX contour diagram, $\mathcal{D}_{\partial A}$, displaying long-range graph connectivity only for long-range entangled states. We validate the protocol by showing that the contour diagrams of the toric and color codes are equivalent except for the number of non-local nodes, which differentiates their topological order. The number of these nodes is robust to the choice of the boundary and ground-state superposition, and they are absent for trivial states, even those with spurious entropy contributions. Our results single out ZX calculus as a tool to detect topological long-range entanglement by leveraging the advantages of diagrammatic reasoning against entropic diagnostics.
Establishing a universal diagnostic of topological order remains an open theoretical challenge. In particular, diagnosing long-range entanglement through the entropic area law suffers from spurious contributions, failing to unambiguously identify topological order. Here we devise a protocol based on the ZX calculus, a graphical tensor network, to determine the topological order of a state circumventing entropy calculations. The protocol takes as input real-space bipartitions of a state and returns a ZX contour diagram, D∂A, displaying long-range graph connectivity only for long-range entangled states. We validate the protocol by showing that the contour diagrams of the toric and color codes are equivalent except for the number of non-local nodes, which differentiates their topological order. The number of these nodes is robust to the choice of the boundary and ground-state superposition, and they are absent for trivial states, even those with spurious entropy contributions. Our results single out ZX calculus as a tool to detect topological long-range entanglement by leveraging the advantages of diagrammatic reasoning against entropic diagnostics.
Topological order represents a profound state of matter characterized by exotic properties robust against local perturbations, such as fractionalized excitations and ground state degeneracy dependent on system topology. While extensively studied in closed quantum systems, the detection and characterization of topological order in open quantum systems, which inevitably interact with their environment, remain a significant challenge. Environmental coupling typically introduces decoherence and dissipation, potentially obscuring or even destroying fragile quantum correlations. This paper investigates the concept of "entropic fingerprints" as a robust diagnostic tool for identifying topological order in systems subjected to environmental influences. We explore how various entanglement measures, particularly the topological entanglement entropy and related information-theoretic quantities, can be adapted and reinterpreted in the context of non-equilibrium steady states or dynamically evolving open systems. Through a theoretical framework employing Lindblad master equations and tensor network methods, we demonstrate that universal signatures of topological order, though potentially modified, can persist in the steady-state entanglement properties of open systems. Our findings suggest that specific patterns in the bipartite entanglement entropy, conditional entropies, and mutual information, robust against a finite range of environmental parameters, can serve as reliable indicators of underlying topological phases. This research not only offers a pathway for experimentally probing topological materials in realistic, noisy environments but also deepens our fundamental understanding of how quantum information is preserved or degraded under open system dynamics.
Here we investigate the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks. We do this for a variety of topologically ordered systems such as the toric code, double semion, colour code and quantum double models. As happens for the entanglement entropy, we find that for sufficiently large block sizes the geometric entanglement is, up to possible sub-leading corrections, the sum of two contributions: a bulk contribution obeying a boundary law times the number of blocks and a contribution quantifying the underlying pattern of long-range entanglement of the topologically ordered state. This topological contribution is also present in the case of single-spin blocks in most cases, and constitutes an alternative characterization of topological order for these quantum states based on a multipartite entanglement measure. In particular, we see that the topological term for the two-dimensional colour code is twice as much as the one for the toric code, in accordance with recent renormalization group arguments (Bombin et al 2012 New J. Phys. 14 073048). Motivated by these results, we also derive a general formalism to obtain upper- and lower-bounds to the geometric entanglement of states with a non-Abelian group symmetry, and which we explicitly use to analyse quantum double models. Furthermore, we also provide an analysis of the robustness of the topological contribution in terms of renormalization and perturbation theory arguments, as well as a numerical estimation for small systems. Some of the results in this paper rely on the ability to disentangle single sites from the quantum state, which is always possible for the systems that we consider. Additionally we relate our results to the behaviour of the relative entropy of entanglement in topologically ordered systems, and discuss a number of numerical approaches based on tensor networks that could be employed to extract this topological contribution for large systems beyond exactly solvable models.
Here we show the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks, for the topological universality class of the toric code model. As happens for the entanglement entropy, we find that for large block sizes the geometric entanglement is, up to possible subleading corrections, the sum of two contributions: a non-universal bulk contribution obeying a boundary law times the number of blocks, and a universal contribution quantifying the underlying pattern of long-range entanglement of a topologically-ordered state.
Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise typically require expensive tensor contractions that are not native to graphical rewriting. Here we show that both entanglement and magic can be efficiently estimated directly from ZX-diagrams. Flow enables efficient extraction of a normal form separating a potentially extensively entangled graph-state backbone from non-Clifford Pauli gadgets. This structure yields additive upper and lower bounds on bipartite entanglement entropy, which we further tighten through a preprocessing procedure that removes or merges redundant non-Clifford contributions. The same normal form gives an upper bound on logarithmic stabilizer extent. We benchmark these methods in random unitary and monitored circuits, and a circuit combining Trotterized Hamiltonian evolution with Clifford layers, finding that the resulting bounds remain informative even at large qubit numbers, circuit depths, and internal spider counts. Our results provide scalable probes of entanglement and non-stabilizerness of ZX-diagrams and establish a bridge between ZX-calculus and quantum many-body resource characterization, with applications across quantum computing, quantum information, and condensed-matter physics.
Topological entanglement entropy (TEE) provides a universal measure of long-range quantum correlations in topologically ordered systems, offering critical insights into exotic phases of matter. While theoretical frameworks, including exactly solvable lattice models, tensor networks, and field-theoretic approaches, enable precise computation of TEE in idealized settings, practical implementation faces multiple challenges. Finite-size and geometry effects, including boundary corners and lattice discretization, introduce significant corrections that can obscure the small topological contribution. Gapless edges in chiral topological phases further complicate the isolation of bulk entanglement, requiring careful separation of edge and bulk contributions. Symmetry-protected and symmetry-enriched phases necessitate additional diagnostics, such as symmetry-resolved entanglement and entanglement negativity, to fully characterize topological properties. Experimental measurement remains challenging, with current approaches limited to small systems using Rényi entropies via swap operations and interferometric methods. This work synthesizes these practical considerations, outlines mitigation strategies, and highlights ongoing directions for bridging theoretical, numerical, and experimental approaches to robustly quantify TEE. Understanding these limitations is essential for accurate characterization of topological order and for guiding the development of quantum technologies leveraging topological protection.
From Feynman diagrams to tensor networks, diagrammatic representations of computations in quantum mechanics have catalyzed progress in physics. These diagrams represent the underlying mathematical operations and aid physical interpretation, but cannot generally be computed with directly. In this paper we introduce the ZXH-calculus, a graphical language based on the ZX-calculus, that we use to represent and reason about many-body states entirely graphically. As a demonstration, we express the one-dimensional (1D) AKLT-state, a symmetry protected topological state, in the ZXH-calculus by developing a representation of spins higher than 1/2 within the calculus. By exploiting the simplifying power of the ZXH-calculus rules we show how this representation straightforwardly recovers the AKLT matrix-product state representation, the existence of topologically protected edge states, and the nonvanishing of a string-order parameter. Extending beyond these known properties, our diagrammatic approach also allows us to analytically derive that the Berry phase of any finite-length 1D AKLT chain is . In addition, we provide an alternative proof that the two-dimensional (2D) AKLT-state on a hexagonal lattice can be reduced to a graph state, demonstrating that it is a universal quantum-computing resource. Lastly, we build 2D higher-order topological phases diagrammatically, which we use to illustrate a symmetry-breaking phase transition. Our results show that the ZXH-calculus is a powerful language for representing and computing with physical states entirely graphically, paving the way to develop more efficient many-body algorithms and giving a novel diagrammatic perspective on quantum phase transitions.