A graphical diagnostic of topological order using ZX calculus
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
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.