Measure of genuine multipartite entanglement with computable lower bounds

Abstract

We introduce an intuitive measure of genuine multipartite entanglement which is based on the well-known concurrence. We show how lower bounds on this measure can be derived that also meet important characteristics of an entanglement measure. These lower bounds are experimentally implementable in a feasible way enabling quantification of multipartite entanglement in a broad variety of cases.

5 pages, 2 figures

References in corpus (9)

• Entanglement detection
• Partial separability and entanglement criteria for multiqubit quantum states
• Multipartite entanglement detection via structure factors
• Experimentally Feasible Security Check for n-qubit Quantum Secret Sharing
• Multipartite entanglement measure for all discrete systems
• Multi-partite entanglement and quantum phase transition in the one-, two-, and three-dimensional transverse field Ising model
• A composite parameterization of unitary groups, density matrices and subspaces
• Two computable sets of multipartite entanglement measures
• Experimentally implementable criteria revealing substructures of genuine multipartite entanglement