Measure of genuine multipartite entanglement with computable lower bounds 论文

2011Physical Review A引用 305
Quantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture

摘要

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 and 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.