Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2205.08801 · Physical Review A

Entanglement polygon inequality in qudit systems

Xue Yang, Yan‐Han Yang, Ming‐Xing Luo

Published Jun 2, 2022• 21 citations
arXivHTMLPDF

Abstract

Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first 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 our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-$(r,s)$ entropy entanglement, including Tsallis entropy, R\'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.

DOI
10.1103/physreva.105.062402

Related papers

Two-parameter bipartite entanglement measure

Chen-Ming Bai, Yu Luo

Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified $(q,s)$-concurrence. Both the standard entanglement concurrence and the recently proposed $q$-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified $(q,s)$-concurrence in the cases of isotropic and Werner states under the constraint $q>1$ and $qs\geq 1$. Furthermore, we explore the monogamy properties of the unified $(q,s)$-concurrence for $q\geq 2$, $0\leq s\leq 1$ and $1\leq qs\leq 3$, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified $(q,s)$-concurrence with $q\geq 1$ and $qs\geq 1$, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.

quant-pharXiv:2601.22568•Feb 2, 2026•0 citations

Polygon relations and subadditivity of entropic measures for discrete and continuous multipartite entanglement

Lijun Liu, Xiaozhen Ge, Shuming Cheng

Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.

arXiv:2401.02066•Physica Scripta•Aug 6, 2024•1 citation

Polygon Inequality-Based Genuine Entanglement Measures

Sumit Chilkoti, Mrittunjoy Guha Majumdar

Genuine multipartite entanglement (GME) represents the strongest form of quantum correlation, where all parties of a system across each bipartition are inseparably linked. This resource is crucial for advanced quantum protocols, including multi-party cryptography and distributed quantum computing, yet its quantification remains a significant theoretical challenge. This review surveys a rapidly evolving geometric paradigm that translates this challenge into a problem of polygon inequalities. By representing marginal bipartite entanglements as side lengths, the distribution of entanglement in a multipartite state must satisfy geometric closure conditions akin to forming a polygon. These polygon-based constraints provide a unifying framework for detecting and quantifying GME, offering an intuitive bridge between bipartite entanglement measures and global multipartite structure. We chart the development of this approach from its monogamy-based origins to modern formulations using concurrence triangles, wedge products, and entropy-based polygons. Recent advances have established rigorous conditions for these geometric quantities to serve as faithful, operationally meaningful entanglement measures, while also extending the framework to mixed states and higher-dimensional systems. Despite progress, key challenges persist in ensuring universal monotonicity and experimental robustness. By synthesizing these geometric insights, this review highlights how polygon inequalities are reshaping the quantification of complex quantum correlations and providing novel diagnostic tools for the next generation of quantum technologies.

•Mar 14, 2026•0 citations

Polygamy of multiparty q -expected quantum entanglement

Jeong San Kim

We characterize the polygamy nature of quantum entanglement in multiparty systems in terms of $q$-expectation value for the full range of $q\ensuremath{\ge}1$. By investigating some properties of generalized quantum correlations in terms of $q$-expectation value and Tsallis $q$-entropy, we establish a class of polygamy inequalities of multiparty quantum entanglement in arbitrary dimensions based on $q$-expected entanglement measure. As Tsallis $q$-entropy is reduced to von Neumann entropy, and $q$-expectation value becomes the ordinary expectation value when $q$ tends to 1, our results encapsulate previous results of polygamy inequalities based on von Neumann entropy as special cases.

arXiv:1909.10346•Physical Review A•Dec 26, 2019•4 citations

Entanglement Polygon Inequalities for A Class of Mixed States

Xian Shi

The study on the entanglement polygon inequality of multipartite systems has attracted much attention. However, most of the results are on pure states. Here we consider the property for a class of mixed states, which are the reduced density matrices of generalized W-class states in multipartite higher dimensional systems. First we show the class of mixed states satisfies the entanglement polygon inequalities in terms of Tsallis-q entanglement, then we propose a class of tighter inequalities for mixed states in terms of Tsallis-q entanglement. At last, we get an inequality for the mixed states, which can be regarded as a relation for bipartite entanglement.

arXiv:2407.03972•Jul 4, 2024•0 citations

Entanglement polygon inequality in qubit systems

Xiao-Feng Qian, Miguel Angel Alonso, Joseph H. Eberly

We prove a set of tight entanglement inequalities for arbitrary N -qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.

arXiv:1806.08415•New Journal of Physics•May 10, 2018•39 citations
Entanglement is an important resource for quantum communication tasks. Most results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We first derive an entanglement polygon inequality for the qqq 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 our study to general entanglement distribution inequalities for high-dimensional entanglement in terms of the unified-(r,s)(r,s)(r,s) entropy entanglement, including Tsallis entropy, R'enyi entropy, and von Neumann entropy entanglement as special cases. These results provide insights into characterizing bipartite high-dimensional entanglement in quantum information processing.
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures, referred to as the unified (q,s)(q,s)(q,s)-concurrence. Both the standard entanglement concurrence and the recently proposed qqq-concurrence emerge as special cases within this family. By combining the positive partial transposition and realignment criteria, we derive an analytical lower bound for this measure for arbitrary bipartite mixed states, revealing a connection to strong separability criteria. Explicit expressions are obtained for the unified (q,s)(q,s)(q,s)-concurrence in the cases of isotropic and Werner states under the constraint q>1q>1q>1 and qs≥1qs\geq 1qs≥1. Furthermore, we explore the monogamy properties of the unified (q,s)(q,s)(q,s)-concurrence for q≥2q\geq 2q≥2, 0≤s≤10\leq s\leq 10≤s≤1 and 1≤qs≤31\leq qs\leq 31≤qs≤3, in qubit systems. In addition, we derive an entanglement polygon inequality for the unified (q,s)(q,s)(q,s)-concurrence with q≥1q\geq 1q≥1 and qs≥1qs\geq 1qs≥1, which manifests the relationship among all the marginal entanglements in any multipartite qudit system.
Abstract In a recent work by us Ge et al [Phys. Rev. A 110, L010402 (2024)], we have derived a series of polygon relations of bipartite entanglement measures that is useful to reveal entanglement properties of discrete, continuous, and even hybrid multipartite quantum systems. In this work, with the information-theoretical measures of Rényi and Tsallis entropies, we study the relationship between the polygon relation and the subadditivity of entropy. In particular, the entropy-polygon relations are derived for pure multi-qubit states and then generalized to multi-mode Gaussian states, by utilizing the known results from the quantum marginal problem. Then the equivalence between the polygon relation and subadditivity is established, in the sense that for all discrete or continuous multipartite states, the polygon relation holds if and only if the underlying entropy is subadditive. As a byproduct, the subadditivity of Rényi and Tsallis entropies is proven for all bipartite Gaussian states. Finally, the difference between polygon relations and monogamy relations is clarified, and generalizations of our results are discussed. Our work provides a better understanding of the rich structure of multipartite states, and hence is expected to be helpful for the study of multipartite entanglement.
Genuine multipartite entanglement (GME) represents the strongest form of quantum correlation, where all parties of a system across each bipartition are inseparably linked. This resource is crucial for advanced quantum protocols, including multi-party cryptography and distributed quantum computing, yet its quantification remains a significant theoretical challenge. This review surveys a rapidly evolving geometric paradigm that translates this challenge into a problem of polygon inequalities. By representing marginal bipartite entanglements as side lengths, the distribution of entanglement in a multipartite state must satisfy geometric closure conditions akin to forming a polygon. These polygon-based constraints provide a unifying framework for detecting and quantifying GME, offering an intuitive bridge between bipartite entanglement measures and global multipartite structure. We chart the development of this approach from its monogamy-based origins to modern formulations using concurrence triangles, wedge products, and entropy-based polygons. Recent advances have established rigorous conditions for these geometric quantities to serve as faithful, operationally meaningful entanglement measures, while also extending the framework to mixed states and higher-dimensional systems. Despite progress, key challenges persist in ensuring universal monotonicity and experimental robustness. By synthesizing these geometric insights, this review highlights how polygon inequalities are reshaping the quantification of complex quantum correlations and providing novel diagnostic tools for the next generation of quantum technologies.
We characterize the polygamy nature of quantum entanglement in multiparty systems in terms of qqq-expectation value for the full range of $q\ensuremath{\ge}1$. By investigating some properties of generalized quantum correlations in terms of qqq-expectation value and Tsallis qqq-entropy, we establish a class of polygamy inequalities of multiparty quantum entanglement in arbitrary dimensions based on qqq-expected entanglement measure. As Tsallis qqq-entropy is reduced to von Neumann entropy, and qqq-expectation value becomes the ordinary expectation value when qqq tends to 1, our results encapsulate previous results of polygamy inequalities based on von Neumann entropy as special cases.
The study on the entanglement polygon inequality of multipartite systems has attracted much attention. However, most of the results are on pure states. Here we consider the property for a class of mixed states, which are the reduced density matrices of generalized W-class states in multipartite higher dimensional systems. First we show the class of mixed states satisfies the entanglement polygon inequalities in terms of Tsallis-q entanglement, then we propose a class of tighter inequalities for mixed states in terms of Tsallis-q entanglement. At last, we get an inequality for the mixed states, which can be regarded as a relation for bipartite entanglement.
We prove a set of tight entanglement inequalities for arbitrary N -qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.