Geometric genuine multipartite entanglement for four-qubit systems

Abstract

Xie and Eberly introduced a genuine multipartite entanglement (GME) measure ‘concurrence fill’ (Xie and Eberly, 2021) for three-party systems. It is defined as the area of a triangle whose side lengths represent squared concurrence in each bi-partition. However, it has been recently shown that concurrence fill is not monotonic under LOCC, hence not a faithful measure of entanglement. Though it is not a faithful entanglement measure, it encapsulates an elegant geometric interpretation of bipartite squared concurrences. There have been a few attempts to generalize GME quantifier to four-party settings and beyond. However, some of them are not faithful, and others simply lack an elegant geometric interpretation. The recent proposal from Xie et al.. constructs a concurrence tetrahedron, whose volume gives the amount of GME for four-party systems; with generalization to more than four parties being the hypervolume of the simplex structure in that dimension. Here, we show by construction that to capture all aspects of multipartite entanglement, one does not need a more complex structure, and the four-party entanglement can be demonstrated using 2D geometry only. The subadditivity together with the Araki-Lieb inequality of linear entropy is used to construct a direct extension of the geometric GME quantifier to four-party systems resulting in quadrilateral geometry. Our quantifier can be geometrically interpreted as a combination of three quadrilaterals whose sides result from the concurrence in one-to-three bi-partition, and diagonal as concurrence in two-to-two bipartition.