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.
For example, {1’1’} will give us the entanglement of the edge joining 1 and 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 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.