Tighter monogamy inequalities of multiqubit entanglement

• URL: http://arxiv.org/abs/2312.09502v1
• Date: Fri, 15 Dec 2023 03:00:06 GMT
• Title: Tighter monogamy inequalities of multiqubit entanglement
• Authors: Jia-Yi Li, Zhong-Xi Shen and Shao-Ming Fei
• Abstract summary: 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.
• Score: 3.9318191265352196
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multipartite entanglement holds great importance in quantum information processing. The distribution of entanglement among subsystems can be characterized by monogamy relations. Based on the $\beta$th power of concurrence and negativity, we provide two new monogamy inequalities. Through detailed examples, we demonstrate that these inequalities are tighter than previous results.

Related papers

• 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)
• General Monogamy and polygamy properties of quantum systems [7.611807718534491]
  We study general monogamy and polygamy relations based on the $alpha$th $(0leqalphaleq gamma)$ power of entanglement measures. We illustrate that these monogamy and polygamy relations are tighter than the inequalities in the article [Quantum Inf Process 19, 101]. For specific entanglement measures such as concurrence and the convex-roof extended negativity, by applying these relations, one can yield the corresponding monogamous and polygamous inequalities.
  arXiv  Detail & Related papers  (2023-02-27T09:09:32Z)
• Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities [91.12425544503395]
  Variational inequalities are used in various applications ranging from equilibrium search to adversarial learning. Most distributed approaches have a bottleneck - the cost of communications. The three main techniques to reduce the total number of communication rounds and the cost of one such round are the similarity of local functions, compression of transmitted information, and local updates. The methods presented in this paper have the best theoretical guarantees of communication complexity and are significantly ahead of other methods for distributed variational inequalities.
  arXiv  Detail & Related papers  (2023-02-15T12:11:27Z)
• 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)
• Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalities [137.6408511310322]
  In this paper we consider a combination of two popular approaches: compression and data similarity. We show that this synergy can be more effective than each of the approaches separately in solving distributed smooth strongly monotonic variational inequalities.
  arXiv  Detail & Related papers  (2022-06-19T16:38:56Z)
• 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)
• Tighter constraints of multiqubit entanglement in terms of unified entropy [0.0]
  We present classes of monogamy inequalities related to the $alpha$-th ($alpha geq 1$) power of the entanglement measure based on the unified-($q,s$) entropy. We show that these monogamy and polygamy inequalities are tighter than the existing ones.
  arXiv  Detail & Related papers  (2021-10-22T03:11:11Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Some Hoeffding- and Bernstein-type Concentration Inequalities [47.24550702683417]
  We prove concentration inequalities for functions of independent random variables under sub-gaussian and sub-exponential conditions. The utility of the inequalities is demonstrated by an extension of the now classical method of Rademacher complexities to Lipschitz function classes and unbounded sub-exponential distribution.
  arXiv  Detail & Related papers  (2021-02-11T23:09:13Z)
• Strong polygamy of multi-party $q$-expected quantum correlations [0.0]
  We show that the polygamous nature of multi-party quantum correlations can be characterized in a em stronger form based on Tsallis $q$-entropy and $q$-expectation value. We further establish the equivalence between strong polygamy inequalities of quantum entanglement and quantum discord distributed in multi-party quantum systems.
  arXiv  Detail & Related papers  (2021-01-14T01:54:40Z)
• Relative Deviation Margin Bounds [55.22251993239944]
  We give two types of learning bounds, both distribution-dependent and valid for general families, in terms of the Rademacher complexity. We derive distribution-dependent generalization bounds for unbounded loss functions under the assumption of a finite moment.
  arXiv  Detail & Related papers  (2020-06-26T12:37:17Z)

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.