Measure of genuine multipartite entanglement with computable lower bounds
Zhi-Hao Ma, Zhi-Hua Chen, Jing-Ling Chen, Christoph Spengler, Andreas, Gabriel, Marcus Huber

TL;DR
This paper proposes a new, experimentally feasible measure for genuine multipartite entanglement based on concurrence, with computable lower bounds that meet key entanglement measure criteria.
Contribution
It introduces a novel multipartite entanglement measure derived from concurrence and provides experimentally implementable lower bounds.
Findings
Lower bounds are derived that satisfy key properties of entanglement measures.
The bounds are experimentally feasible to implement.
The measure enables quantification of multipartite entanglement in various scenarios.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
