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 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}$.

arXiv:0909.1603Journal of Physics B Atomic Molecular and Optical PhysicsApr 6, 201013 citations

Multipartite entanglement in four-qubit graph states

Mojtaba Jafarpour, Leila Assadi

The European Physical Journal DMar 1, 20163 citations

Entangled graphs: a classification of four-qubit entanglement

Masoud Gharahi, Seyed Javad Akhtarshenas

arXiv:1003.2762The European Physical Journal DMar 1, 201623 citations

Analyzing the entanglement properties of graph states with generalized concurrence

Ahmad Akhound, Saeed Haddadi, Mohammad Ali Chaman Motlagh

We propose a new classification for the entanglement in graph states based on generalized concurrence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states in 10 classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule. Furthermore, our results suggest that the generalized concurrence is a suitable measure of entanglement for multi-qubit graph states.We propose a new classification for the entanglement in graph states based on generalized concurrence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states in 10 classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule. Furthermore, our results suggest that the generalized concurrence is a suitable measure of entanglement for multi-qubit graph states.

Modern Physics Letters BMar 19, 201923 citations

Calculation of entanglement in graph states up to five-qubit based on generalized concurrence

Ahmad Akhound, Saeed Haddadi, Mohammad Ali Chaman Motlagh

We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states are in ten classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule.We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states are in ten classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule.

arXiv:1610.02560Oct 8, 20160 citations

Entanglement in multipartite quantum systems in the context of graph states

Junyi WU

Apr 22, 20150 citations

10^{-14}