The entanglement of graph states can be calculated by adopting Iterative algorithm. The number of inequivalent classes of 9-qubit graph states is 440. All 440 local inequivalent graphs are classified as two categories: graphs with equal upper LOCC entanglement bound and lower bipartite entanglement
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than 10−14.
The number of inequivalent classes of up to 8-qutrit graph states is 1002, with 239 decomposable graphs and 763 indecomposable graphs. Apparently, the former can be decomposed to several indecomposable parts. For qubit graph states, the upper and lower bounds of entanglement have been given. If the two bounds don't coincide, the entanglement can be calculated by iterative method. For qutrit graph states, their lower bounds can be found through the local complementation operations. But its hard to find the upper bound because the qutrit graph states have 2 basis states which are GHZ state and W state. Fortunately, the iterative method can also be used here. In this paper, we calculated the entanglement of all the 1002 graph states. Through researching the results, we found the similar feature with graph qubit states that the decimal part of entanglement is stable.
The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if $n\ensuremath{\ge}7$. On the other hand, the set of invariants proposed by van den Nest, Dehaene, and De Moor (VDD) [Phys. Rev. A 72, 014307 (2005)] distinguishes between inequivalent classes, but contains too many invariants (more than $2\ifmmode\times\else\texttimes\fi{}{10}^{36}$ for n=7) to be practical. Here we solve the problem of deciding which entanglement class a graph state of $n\ensuremath{\le}8$ qubits belongs to by calculating some of the state's intrinsic properties. We show that four invariants related to those proposed by VDD are enough for distinguishing between all inequivalent classes with $n\ensuremath{\le}8$ qubits.
Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.