2025/12/14 by Guo, Jie, Jin Chuan Hou, Yang, Shuyuan +5
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2512.12588
openalex publication_date 2025/12/14 · openalex created_date 2025/12/17 · openalex updated_date 2026/07/28
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 true k-entanglement measure, Ew(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.