Generalized Geometric Measure of Entanglement for Multiparty Mixed States
Tamoghna Das, Sudipto Singha Roy, Shrobona Bagchi, Avijit Misra, Aditi, Sen De, Ujjwal Sen

TL;DR
This paper introduces a method to compute a genuine multiparty entanglement measure for certain symmetric mixed states, simplifying the complex optimization usually involved in such calculations.
Contribution
It presents a novel approach leveraging symmetries to calculate the generalized geometric measure for multipartite mixed states of varying ranks and parties.
Findings
Efficient computation of entanglement for symmetric mixed states
Applicable to states with different ranks and arbitrary number of parties
Provides a practical tool for entanglement quantification in complex systems
Abstract
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a genuine multiparty entanglement measure, the generalized geometric measure for these classes of mixed states. The chosen states have different ranks and consist of an arbitrary number of parties.
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.
