AIP conference proceedings
Evaluation of multipartite entanglement in graph states
Michal Hajdušek, Mio Murao
Abstract
We address the question of quantifying entanglement in pure graph states. We demonstrate how solving one problem in graph theory, namely the identification of maximum independent set, allows for analytic evaluation of three multipartite entanglement measures for pure graph states. We achieve this by explicit construction of relevant closest separable states and minimal linear decompositions into product states. We show how these separable states can be described using stabiliser formalism as well as PEPs-like construction opening the possibility to applying same techniques to more general states, such as weighted graph states.