Unified monogamy and polygamy relations for multipartite systems

• URL: http://arxiv.org/abs/2607.14370v1
• Date: Wed, 15 Jul 2026 21:17:33 GMT
• Title: Unified monogamy and polygamy relations for multipartite systems
• Abstract summary: Bipartite entanglement measure $mathcalE$ satisfies the $$th-power monogamy inequality (Eq.eqrefe:chap1-ineq1), and for its assisted counterpart $mathcalE_a$ that obeys the $$th-power polygamy inequality.<n>We show that our results generalize and strengthen existing monogamy and polygamy relations.<n>This hierarchical, parameterized approach offers enhanced and flexible tools for applications in quantum communication, quantum networks, and multipartite quantum information processing.
• Score: 4.4365707789395845
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse [50.69285844345291]
  We study tradeoff between solution quality and stability when elements arrive over time.<n>Our algorithm has a future implementation for rational oracle$ with $O(varepsilon-1)$ recourse and separate the existence of universal-price certificates from their efficient algorithms.
  arXiv  Detail & Related papers  (2026-09-09T10:13:43Z)
• Sample Complexity of Multicalibration for Multilevel Properties [52.27687531970317]
  We study multicalibration for a sequence of $k$ properties in which each property is identifiable once the preceding properties are fixed.<n>Even with only polylogarithmically many binary groups, achieving multicalibration error $varepsilon$ requires $widetilde(varepsilon-(k+2))$ samples.
  arXiv  Detail & Related papers  (2026-08-04T23:38:54Z)
• Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale [54.65053906803857]
  We study the optimal scale at which real-valued function classes exhibit uniform convergence and learnability.<n>Our main result establishes a scale-sensitive generalization of the fundamental theorem of PAC learning.<n>We also highlight several open questions on quantitative sample complexity and evaluability.
  arXiv  Detail & Related papers  (2026-05-13T15:41:30Z)
• Hardness of High-Dimensional Linear Classification [58.29089693778071]
  We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem.<n>Both are fundamental problems in computational geometry and machine learning in their exact and approximate forms.
  arXiv  Detail & Related papers  (2026-03-19T15:53:41Z)
• Parameterized bipartite entanglement measures and entanglement constraints [1.125136513287558]
  We prove a novel class of parameterized entanglement measures which are named as $G_omega$-concurrence ($G_omega$C)<n>We also prove a new polygamy relation of multiqubit quantum entanglement in terms of $G_omega$-concurrence of assistance ($G_omega$CoA)<n>Based on the monogamy properties of S$G_omega$C, we can construct the corresponding multipartite entanglement indicators, which can detect all genuine multiqubit entangled states even in the case of $N$-tangle vanishes.
  arXiv  Detail & Related papers  (2025-03-18T13:32:21Z)
• Superior monogamy and polygamy relations and estimates of concurrence [6.408200192709026]
  We present a class of tighter parameterized monogamy relation for the $alpha$th $(alphageqgamma)$ power based on Eq. (1.1)<n>This study provides a family of tighter lower (resp. upper) bounds of the monogamy (resp. polygamy) relations in a unified manner.
  arXiv  Detail & Related papers  (2025-03-02T02:25:34Z)
• Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability [85.07238533644636]
  $Phi$-equilibria is a powerful and flexible framework at the heart of online learning and game theory.<n>We show that an efficient online algorithm incurs average $Phi$-regret at most $epsilon$ using $textpoly(d, k)/epsilon2$ rounds.<n>We also show nearly matching lower bounds in the online setting, thereby obtaining for the first time a family of deviations that captures the learnability of $Phi$-regret.
  arXiv  Detail & Related papers  (2025-02-25T19:08:26Z)
• Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits [49.96531901205305]
  We analyze $f$-divergence-regularized offline policy learning.<n>For reverse Kullback-Leibler (KL) divergence, we give the first $tildeO(epsilon-1)$ sample complexity under single-policy concentrability.<n>We extend our analysis to dueling bandits, and we believe these results take a significant step toward a comprehensive understanding of $f$-divergence-regularized policy learning.
  arXiv  Detail & Related papers  (2025-02-09T22:14:45Z)
• G_q-concurrence and entanglement constraints in multiqubit systems [2.150800093140658]
  We show that $G_q$-concurrence satisfies all the axiomatic conditions of an entanglement measure and can be considered as a generalization of concurrence. We construct a set of entanglement indicators that can detect genuinely multiqubit entangled states even when the tangle loses its efficacy.
  arXiv  Detail & Related papers  (2024-06-27T11:07:51Z)
• Tightening monogamy and polygamy relations of unified entanglement in multipartite systems [1.6353216381658506]
  We first derive the monogamy inequality of unified-$(q, s)$ entanglement for multi-qubit states under arbitrary bipartition. We then obtain the monogamy inequalities of the $alpha$th ($0leqalphaleqfracr2, rgeqsqrt2$) power of entanglement of formation for tripartite states.
  arXiv  Detail & Related papers  (2022-05-12T23:27:16Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Monogamy and polygamy relations of quantum correlations for multipartite systems [1.6353216381658506]
  We study the monogamy and polygamy inequalities of quantum correlations in arbitrary dimensional multipartite quantum systems. We show that the monogamy relations are satisfied by other quantum correlation measures such as entanglement of formation.
  arXiv  Detail & Related papers  (2022-02-07T16:44:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.