Entanglement of graph states up to 8 qubits

Abstract

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

6 pages

References in corpus (9)

• Experimental One-Way Quantum Computing
• Multi-party entanglement in graph states
• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• Experimental entanglement of six photons in graph states
• Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication
• Entanglement of multiparty stabilizer, symmetric, and antisymmetric states
• Entanglement and local information access for graph states
• Relative entropy of entanglement for certain multipartite mixed states
• Connecting the generalized robustness and the geometric measure of entanglement

Cited by in corpus (2)

• Geometric measure of entanglement for pure multipartite states
• Efficient Entanglement Measure for Graph States