Entanglement of graph states up to 8 qubits. (arXiv:0909.1603v1 [quant-ph])

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 three categories:
the 2-colorable graphs, the non 2-colorable graphs with identical upper LOCC
entanglement bound and lower bipartite entanglement bound, the non 2-colorable
graphs with unequal bounds. The last may displays non-integer entanglement. The
precision of iteration calculation of the entanglement is less than $10^{-14}$.

Published by

Original source : http://arxiv.org/abs/0909.1603...