The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States

Adam Burchardt, Frederik Hahn

This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by t…