$k$-Entanglement Measure for Multipartite Systems without Convex-Roof Extensions and its Evaluation
Jie Guo, Shuyuan Yang, Jinchuan Hou, Xiaofei Qi, Kan He
TL;DR
This work introduces a universal axiomatic framework for multipartite entanglement that defines a true $k$-entanglement measure $E_w^{(k,n)}$ without convex-roof extensions. Grounded in entanglement witnesses and a maximization over $k$-partitions through $g_n^{(k)}(L)$, the measure is faithful, LOCC-monotone, convex, and obeys unification and hierarchy, thereby treating $k$-entanglement as a bona fide resource. The authors provide a universal evaluation strategy and an open-source software suite that computes $E_w^{(k,n)}$ for $n$-partite finite-dimensional systems (and specifically for $n$-qubit cases with $2\leq n\leq 4$), demonstrating accuracy against known thresholds and improved precision on noisy states such as Werner and W states. This framework offers scalable, practical multipartite entanglement quantification with broad implications for quantum information processing and experimental verification of quantum resources.
Abstract
Multipartite entanglement underpins quantum technologies but its study is limited by the lack of universal measures, unified frameworks, and the intractability of convex-roof extensions. We establish an axiomatic framework and introduce the first \emph{true} $k$-entanglement measure, $E_w^{(k,n)}$, which satisfies all axioms, establishes $k$-entanglement as a multipartite quantum resource, avoids convex-roof constructions, and is efficiently computable. A universal algorithm evaluates arbitrary finite-dimensional states, with open-source software covering all partitions of four-qubit systems. Numerical tests certify $k$-entanglement within 200 seconds, consistent with necessary-and-sufficient criteria, tightening bounds and revealing new thresholds. This framework offers a scalable, practical tool for rigorous multipartite entanglement quantification.
