Entanglement polygon inequality in qudit systems (2205.08801v1)

Abstract: Entanglement is one of important resources for quantum communication tasks. Most of results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We firstly derive an entanglement polygon inequality for the $q$-concurrence, which manifests the relationship among all the "one-to-group" marginal entanglements in any multipartite qudit system. This implies lower and upper bounds for the marginal entanglement of any three-qudit system. We further extend to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-$(r, s)$ entropy entanglement including Tsallis entropy, R\'{e}nyi entropy, and von Neumann entropy entanglement as special cases. These results provide new insights into characterizing bipartite high-dimensional entanglement in quantum information processing.