The paper defines an Entanglement Matrix and claims maximum entanglement of n-qubit graph states is N^2-N for odd N, with piecewise quadratic formulas for even N and a special enhancement for multiples of 12.
(either clock- wise or anticlockwise) to get an ordered structure of qubits, and then take the midpoints of all the possible edges joining two qubits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Entanglement Classification in the Graph States: The generalization to $n$-Qubits States using the Entanglement Matrix
The paper defines an Entanglement Matrix and claims maximum entanglement of n-qubit graph states is N^2-N for odd N, with piecewise quadratic formulas for even N and a special enhancement for multiples of 12.