Maximum residual strong monogamy inequality for multiqubit entanglement

• URL: http://arxiv.org/abs/2602.10668v2
• Date: Thu, 12 Feb 2026 03:53:15 GMT
• Title: Maximum residual strong monogamy inequality for multiqubit entanglement
• Authors: Dong-Dong Dong, Xue-Ke Song, Liu Ye, Dong Wang, Gerardo Adesso,
• Abstract summary: We establish two new inequalities, the weighted strong monogamy (WSM) and the maximum residual strong monogamy (MRSM)<n>The WSM inequality distinguishes itself from the strong monogamy (SM) conjecture by using coefficients rather than exponents to modulate the weight allocated to various m-partite contributions.<n>The MRSM inequality is formulated using only the maximum m-partite entanglement.
• Score: 2.728572386373239
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We establish two new inequalities, the weighted strong monogamy (WSM) and the maximum residual strong monogamy (MRSM), which sharpen the generalized Coffman-Kundu-Wootters inequity for multiqubit states. The WSM inequality distinguishes itself from the strong monogamy (SM) conjecture [Phys. Rev. Lett. 113, 110501 (2014)] by using coefficients rather than exponents to modulate the weight allocated to various m-partite contributions. In contrast, the MRSM inequality is formulated using only the maximum m-partite entanglement. We find that the residual entanglement of the MRSM inequality can effectively distinguish the separable states. We also compare the tightness of various SM inequalities and provide examples using a four-qubit mixed state and a five-qubit pure state to illustrate the MRSM inequality. These examples characterize the trade-off relations among entanglement components involving varying numbers of qubits. Our results provide a rigorous framework to characterize and quantify the monogamy of multipartite entanglement.

Related papers

• Towards Uniformity and Alignment for Multimodal Representation Learning [66.87764574237532]
  We identify two conflicts in the multimodal regime, both exacerbated as the number of modalities increases.<n>We propose a principled decoupling of alignment and uniformity for multimodal representations.<n>We then provide a theoretical guarantee that our method acts as an efficient proxy for a global Hlder divergence over multiple modality distributions.
  arXiv  Detail & Related papers  (2026-02-10T08:08:07Z)
• Principled Multimodal Representation Learning [99.53621521696051]
  Multimodal representation learning seeks to create a unified representation space by integrating diverse data modalities.<n>Recent advances have investigated the simultaneous alignment of multiple modalities, yet several challenges remain.<n>We propose Principled Multimodal Representation Learning (PMRL), a novel framework that achieves simultaneous alignment of multiple modalities.
  arXiv  Detail & Related papers  (2025-07-23T09:12:25Z)
• Multipartite Monogamy of Entanglement for Three Qubit States [0.0]
  We explore how quantum entanglement can be distributed in accordance with monogamy relations. We analytically demonstrate that the square of the source entanglement serves as an upper bound for the sum of the squares of the entanglement of formation of the reduced subsystems.
  arXiv  Detail & Related papers  (2024-09-01T23:17:42Z)
• Tighter Constraints of Multi-Qubit Entanglement in Terms of Nonconvex Entanglement Measures LCREN and LCRENoA [1.2070981561059435]
  The monogamy property of characterizing multipart quantum entanglement is an intriguing feature. Measures satisfying the monogamy inequality are turned out to violate our constraints.
  arXiv  Detail & Related papers  (2024-02-01T09:55:14Z)
• Tighter monogamy inequalities of multiqubit entanglement [3.9318191265352196]
  Multipartite entanglement holds great importance in quantum information processing. We provide two new monogamy inequalities based on the $beta$th power of concurrence and negativity.
  arXiv  Detail & Related papers  (2023-12-15T03:00:06Z)
• Complete Genuine Multipartite Entanglement Monotone [3.832210766570055]
  We study whether the multipartite entanglement monotone (MEM) and genuine multipartite entanglement monotone (GMEM) are complete, completely monogamous, and tightly complete monogamous according to the feature of the reduced function.<n>In addition, the relation between monogamy, complete monogamy, and the tightly complete monogamy are revealed in light of different kinds of MEMs and GMEMs.
  arXiv  Detail & Related papers  (2023-01-01T03:00:47Z)
• Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning [79.83792914684985]
  We prove a new identifiability result that provides conditions under which maximally sparse base-predictors yield disentangled representations. Motivated by this theoretical result, we propose a practical approach to learn disentangled representations based on a sparsity-promoting bi-level optimization problem.
  arXiv  Detail & Related papers  (2022-11-26T21:02:09Z)
• On the Equity of Nuclear Norm Maximization in Unsupervised Domain Adaptation [53.29437277730871]
  Nuclear norm has shown the power to enhance the transferability of unsupervised domain adaptation model. Two new losses are proposed to maximize both predictive discriminability and equity, from the class level and the sample level.
  arXiv  Detail & Related papers  (2022-04-12T07:55:47Z)
• A new parameterized monogamy relation between entanglement and equality [0.0]
  A monogamy equality rather than the usual inequality is presented based on the monogamy weight. We show that monogamy relations can be recovered by considering multiple copies of states for every non-additive entanglement measure.
  arXiv  Detail & Related papers  (2022-03-30T19:27:59Z)
• A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs [117.82903457289584]
  We derive a novel problem-dependent lower-bound for regret in finite-horizon Markov Decision Processes (MDPs) We show that our lower-bound is considerably smaller than in the general case and it does not scale with the minimum action gap at all. We show that this last result is attainable (up to $poly(H)$ terms, where $H$ is the horizon) by providing a regret upper-bound based on policy gaps for an optimistic algorithm.
  arXiv  Detail & Related papers  (2021-06-24T13:46:09Z)
• A Unified Joint Maximum Mean Discrepancy for Domain Adaptation [73.44809425486767]
  This paper theoretically derives a unified form of JMMD that is easy to optimize. From the revealed unified JMMD, we illustrate that JMMD degrades the feature-label dependence that benefits to classification. We propose a novel MMD matrix to promote the dependence, and devise a novel label kernel that is robust to label distribution shift.
  arXiv  Detail & Related papers  (2021-01-25T09:46:14Z)

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.