arXiv Analytics

Sign in

arXiv:1101.2001 [quant-ph]AbstractReferencesReviewsResources

Measure of genuine multipartite entanglement with computable lower bounds

Zhi-Hao Ma, Zhi-Hua Chen, Jing-Ling Chen, Christoph Spengler, Andreas Gabriel, Marcus Huber

Published 2011-01-11, updated 2011-06-20Version 2

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.

Related articles: Most relevant | Search more
arXiv:1206.6669 [quant-ph] (Published 2012-06-28, updated 2013-01-15)
Measure of multipartite entanglement with computable lower bounds
arXiv:1006.1152 [quant-ph] (Published 2010-06-07)
Evaluation of two different entanglement measures on a bound entangled state
arXiv:0710.3425 [quant-ph] (Published 2007-10-18, updated 2009-01-27)
An entanglement measure for n-qubits