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

Polygamy relations of multipartite entanglement beyond qubits

Jin, Z., Fei, S.

Published Jan 1, 2019• 5 citations
OpenAlex

Abstract

We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $\alpha$th $(0\leq \alpha\leq 2)$ power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the $\beta$th ($0\leq \beta \leq 1$) power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.

Related papers

Polygamy relations of multipartite entanglement beyond qubits

Zhi-Xiang Jin, Shao-Ming Fei

Abstract We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the th power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the th ( ) power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.

arXiv:1903.11350•Journal of Physics A Mathematical and Theoretical•Mar 12, 2019•5 citations

Tighter weighted polygamy inequalities of multipartite entanglement in arbitrary-dimensional quantum systems

Chen, B., Yang, L., Fei, S. +1 more

We investigate polygamy relations of multipartite entanglement in arbitrary-dimensional quantum systems. By improving an inequality and using the βth (0 ≤ β ≤ 1) power of entanglement of assistance, we provide a new class of weighted polygamy inequalities of multipartite entanglement in arbitrary-dimensional quantum systems. We show that these new polygamy relations are tighter than the ones given in Kim (Phys. Rev. A 97, 042332 2018).

•Jan 1, 2019•3 citations

Polygamy relations of multipartite systems

Jin, Z., Fei, S., Qiao, C.

We investigate the polygamy relations of multipartite quantum states. General polygamy inequalities are given in the $$\alpha $$ th $$(\alpha \ge 2)$$ power of concurrence of assistance, $$\beta $$ th $$(\beta \ge 1)$$ power of entanglement of assistance, and the squared convex-roof extended negativity of assistance (SCRENoA).

•Jan 1, 2019•5 citations

Polygamy of entanglement in multipartite quantum systems

Jeong San Kim

We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytical upper bound for the concurrence of assistance in bipartite quantum systems and derive a polygamy inequality of multipartite entanglement in arbitrary-dimensional quantum systems.

arXiv:0904.3061•Physical Review A•Aug 4, 2009•13 citations

Weighted polygamy inequalities of multiparty entanglement in arbitrary-dimensional quantum systems

Jeong San Kim

We provide a generalization for the polygamy constraint of multiparty entanglement in arbitrary-dimensional quantum systems. By using the $\ensuremath{\beta}\mathrm{th}$ power of entanglement of assistance for $0\ensuremath{\le}\ensuremath{\beta}\ensuremath{\le}1$ and the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of weighted polygamy inequalities of multiparty entanglement in arbitrary-dimensional quantum systems. We further show that our class of weighted polygamy inequalities can even be improved to be tighter inequalities with some conditions on the assisted entanglement of bipartite subsystems.

arXiv:1802.00336•Physical Review A•Apr 18, 2018•34 citations

Unified monogamy and polygamy relations for multipartite systems

Yue Cao, Naihuan Jing, Kailash Misra +1 more

For a bipartite entanglement measure $\mathcal{E}$ that satisfies the $γ$th-power monogamy inequality (Eq.~\eqref{e:chap1-ineq1}), and for its assisted counterpart $\mathcal{E}_a$ that obeys the $δ$th-power polygamy inequality (Eq.~\eqref{e:chap1-ineq2}), we introduce a unified, tunable framework indexed by a parameter $m\geq1$. Within this framework, we derive two hierarchical families of refined inequalities: a tightened $α$-power monogamy relation for $\mathcal{E}$, valid for all $α\geq mγ$; a tightened $β$-power polygamy relation for $\mathcal{E}_a$, applicable for $(m-1)δ< β\leq mδ$. As $m$ increases, the bounds become progressively tighter, recovering known results at $m=1$. Notably, the optimal monogamy bound emerges as a piecewise function of $α$, with additional correction terms activated as $α$ crosses successive integer thresholds, thereby offering a sharper characterization of entanglement distribution. We demonstrate that our results generalize and strengthen existing monogamy and polygamy relations through analytical comparisons and numerical evaluations using concurrence and concurrence of assistance. This hierarchical, parameterized approach offers enhanced and flexible tools for applications in quantum communication, quantum networks, and multipartite quantum information processing.

quant-pharXiv:2607.14370•Quantum Information Processing•Jul 17, 2026•0 citations
We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the α\alphaαth (0≤α≤2)(0\leq \alpha\leq 2)(0≤α≤2) power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the β\betaβth (0≤β≤10\leq \beta \leq 10≤β≤1) power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.
Abstract We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the th power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a multipartite system. Moreover, the th ( ) power of polygamy inequalities are obtained for the entanglement of assistance as a by-product, which are shown to be tighter than the existing ones. A detailed example is presented.
We investigate the polygamy relations of multipartite quantum states. General polygamy inequalities are given in the α\alpha α th (α≥2)(\alpha \ge 2)(α≥2) power of concurrence of assistance, β\beta β th (β≥1)(\beta \ge 1)(β≥1) power of entanglement of assistance, and the squared convex-roof extended negativity of assistance (SCRENoA).
We provide a generalization for the polygamy constraint of multiparty entanglement in arbitrary-dimensional quantum systems. By using the $\ensuremath{\beta}\mathrm{th}$ power of entanglement of assistance for $0\ensuremath{\le}\ensuremath{\beta}\ensuremath{\le}1$ and the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of weighted polygamy inequalities of multiparty entanglement in arbitrary-dimensional quantum systems. We further show that our class of weighted polygamy inequalities can even be improved to be tighter inequalities with some conditions on the assisted entanglement of bipartite subsystems.
For a bipartite entanglement measure E\mathcal{E}E that satisfies the γγγth-power monogamy inequality (Eq.~\eqref{e:chap1-ineq1}), and for its assisted counterpart Ea\mathcal{E}_aEa​ that obeys the δδδth-power polygamy inequality (Eq.~\eqref{e:chap1-ineq2}), we introduce a unified, tunable framework indexed by a parameter m≥1m\geq1m≥1. Within this framework, we derive two hierarchical families of refined inequalities: a tightened ααα-power monogamy relation for E\mathcal{E}E, valid for all α≥mγα\geq mγα≥mγ; a tightened βββ-power polygamy relation for Ea\mathcal{E}_aEa​, applicable for (m−1)δ<β≤mδ(m-1)δ< β\leq mδ(m−1)δ<β≤mδ. As mmm increases, the bounds become progressively tighter, recovering known results at m=1m=1m=1. Notably, the optimal monogamy bound emerges as a piecewise function of ααα, with additional correction terms activated as ααα crosses successive integer thresholds, thereby offering a sharper characterization of entanglement distribution. We demonstrate that our results generalize and strengthen existing monogamy and polygamy relations through analytical comparisons and numerical evaluations using concurrence and concurrence of assistance. This hierarchical, parameterized approach offers enhanced and flexible tools for applications in quantum communication, quantum networks, and multipartite quantum information processing.