Fully multi-qubit entangled states

Abstract

We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in connected graph states of N>3 qubits there is no genuine three-qubit entanglement. For certain classes of graph states, all genuine k-qubit entanglement, 2\leq k\leq N-1, among every k qubits vanishes. These results about connected graph states naturally lead to the definition of fully multi-qubit entangled states. We also find that the connected graph states of four qubits is one but not the only one class of fully four-qubit entangled states.

9 pages, 1 figure. Extra conditions for theorem 2 and corollary 1 are added

References in corpus (8)

• Multi-party entanglement in graph states
• Bell Inequalities for Graph States
• Constructing N-qubit entanglement monotones from anti-linear operators
• Entangled three-qubit states without concurrence and three-tangle
• Entanglement in the stabilizer formalism
• Inductive classification of multipartite entanglement under SLOCC
• Information-Theoretic Measure of Genuine Multi-Qubit Entanglement
• Complementarity and Entanglement in Quantum Information Theory