Graph-based approach to entanglement entropy of quantum error-correcting codes
Phys. Rev. A 113, 052412 – Published 6 May, 2026
DOI: https://doi.org/10.1103/jc6b-txy9
Abstract
We develop a graph-based method to study the entanglement entropy of Calderbank-Shor-Steane quantum codes. This method offers a straightforward interpretation for the entanglement entropy of quantum error-correcting codes through graph-theoretical concepts, shedding light on the origins of both the local and long-range entanglement. Moreover, it inspires a scheme for evaluating the entanglement entropy of arbitrary Calderbank-Shor-Steane quantum codes, which can be computationally advantageous when a simple graph representation is available. We illustrate the method by calculating the von Neumann entropy of subsystems in toric codes and two types of quantum low-density parity-check codes, and by comparing the scaling behavior of the entanglement entropy with respect to the subsystem size. Our method introduces a perspective for understanding the entanglement structure in quantum many-body systems.