Abstract Based on q -expected entanglement measure for q ⩾ 1 , we generalize the polygamy inequality for multiparty entanglement in arbitrary-dimensional quantum systems. By using the β th-power of the q -expected entanglement of assistance for 0 ⩽ β ⩽ 1 and the Hamming weight of the binary vector related with the distribution of subsystems, a class of weighted polygamy inequalities in arbitrary-dimensional quantum systems is established. We further demonstrate that our class of weighted polygamy inequalities can be improved even into tighter inequalities, under some conditions, with auxiliary entanglement in bipartite subsystems. Our results may provide new ideas for studying the polygamy constraints of multiparty entanglement and better characterizing the entanglement distribution.
The monogamy and polygamy properties of quantum entanglement characterize fundamental constraints on the distribution of entanglement in multipartite quantum systems. In this paper, we investigate tighter monogamy and polygamy relations for multipartite entanglement. By establishing a new mathematical inequality, we derive a family of improved monogamy and polygamy inequalities for tripartite quantum systems and further extend these results to general multipartite systems. Comparisons with existing results show that the obtained bounds are tighter. Illustrative examples are provided to demonstrate the effectiveness of the proposed relations.
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.
I establish a unified view of polygamy of multiqubit entanglement. I first introduce a two-parameter generalization of the entanglement of assistance, namely, the unified entanglement of assistance for bipartite quantum states, and provide an analytic lower bound in two-qubit systems. I show a broad class of polygamy inequalities of multiqubit entanglement in terms of the unified entanglement of assistance that encapsulates all known multiqubit polygamy inequalities as special cases. I further show that this class of polygamy inequalities can be improved into tighter inequalities for three-qubit systems.
For a bipartite entanglement measure
E that satisfies the
γth-power monogamy inequality (Eq.~\eqref{e:chap1-ineq1}), and for its assisted counterpart
Ea that obeys the
δth-power polygamy inequality (Eq.~\eqref{e:chap1-ineq2}), we introduce a unified, tunable framework indexed by a parameter
m≥1. Within this framework, we derive two hierarchical families of refined inequalities:
a tightened
α-power monogamy relation for
E, valid for all
α≥mγ;
a tightened
β-power polygamy relation for
Ea, applicable for
(m−1)δ<β≤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.