Entanglement of graph states up to 8 qubits

TL;DR

This paper calculates and classifies the entanglement of all 146 local inequivalent graph states up to 8 qubits using iterative methods, revealing detailed entanglement properties and bounds.

Contribution

It provides a comprehensive classification and precise entanglement calculations for all small graph states, including non-integer values and bound comparisons.

Findings

All 146 graph states classified into two categories based on entanglement bounds.

High-precision entanglement calculations with less than 10^{-14} error.

Identification of non-integer entanglement values in certain graph states.

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