Tighter monogamy and polygamy relations of quantum entanglement in multi-qubit systems

• URL: http://arxiv.org/abs/2112.15410v1
• Date: Fri, 31 Dec 2021 12:37:55 GMT
• Title: Tighter monogamy and polygamy relations of quantum entanglement in multi-qubit systems
• Authors: Wen-Wen Liu, Zi-Feng Yang, Shao-Ming Fei
• Abstract summary: We investigate the monogamy relations related to the concurrence, the entanglement of formation, convex-roof extended negativity, Tsallis-q entanglement and R'enyi-alpha entanglement. Monogamy and polygamy inequalities are obtained for arbitrary multipartite qubit systems, which are proved to be tighter than the existing ones.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the monogamy relations related to the concurrence, the entanglement of formation, convex-roof extended negativity, Tsallis-q entanglement and R'enyi-{\alpha} entanglement, the polygamy relations related to the entanglement of formation, Tsallis-q entanglement and R'enyi-{\alpha} entanglement. Monogamy and polygamy inequalities are obtained for arbitrary multipartite qubit systems, which are proved to be tighter than the existing ones. Detailed examples are presented.

Related papers

• Weighted monogamy and polygamy relations [7.867858589759733]
  We show that whenever a bound is given (named it monogamy or polygamy) our bound indexed by some parameter $s$ will always be stronger than the given bound derived from the base relation. The study includes detailed examples, highlighting that our findings exhibit greater strength across all existing cases in comparison.
  arXiv  Detail & Related papers  (2024-02-21T23:19:02Z)
• An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [79.43134049617873]
  In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function. For an alphabet size, we have a constant versus separation complexity.
  arXiv  Detail & Related papers  (2023-01-22T22:08:28Z)
• The Dynamics of Riemannian Robbins-Monro Algorithms [101.29301565229265]
  We propose a family of Riemannian algorithms generalizing and extending the seminal approximation framework of Robbins and Monro. Compared to their Euclidean counterparts, Riemannian algorithms are much less understood due to lack of a global linear structure on the manifold. We provide a general template of almost sure convergence results that mirrors and extends the existing theory for Euclidean Robbins-Monro schemes.
  arXiv  Detail & Related papers  (2022-06-14T12:30:11Z)
• Tighter monogamy relations for the Tsallis-q and R\'{e}nyi-$\alpha$ entanglement in multiqubit systems [7.649038921524315]
  We present some tighter monogamy relations in terms of the power of the Tsallis-q and R'enyi-$alpha$ entanglement in multipartite systems.
  arXiv  Detail & Related papers  (2021-11-24T09:37:29Z)
• Tighter Monogamy Relations in Multi-Qubit Systems [7.649038921524315]
  We present some monogamy relations of multiqubit quantum entanglement in terms of the beta th power of concurrence, entanglement of formation and convex-roof extended negativity. These monogamy relations are proved to be tighter than the existing ones, together with detailed examples showing the tightness.
  arXiv  Detail & Related papers  (2021-10-13T09:15:59Z)
• Tighter monogamy and polygamy relations for a superposition of the generalized $W$-class state and vacuum [0.0]
  We investigate the monogamy and polygamy relations with respect to any partitions for a superposition of the generalized $W$-class state. New classes of monogamy and polygamy inequalities are derived, which are shown to be tighter than the existing ones.
  arXiv  Detail & Related papers  (2021-09-23T10:21:01Z)
• R\'enyi divergence inequalities via interpolation, with applications to generalised entropic uncertainty relations [91.3755431537592]
  We investigate quantum R'enyi entropic quantities, specifically those derived from'sandwiched' divergence. We present R'enyi mutual information decomposition rules, a new approach to the R'enyi conditional entropy tripartite chain rules and a more general bipartite comparison.
  arXiv  Detail & Related papers  (2021-06-19T04:06:23Z)
• Constraints on Maximal Entanglement Under Groups of Permutations [73.21730086814223]
  Sets of entanglements are inherently equal, lying in the same orbit under the group action. We introduce new, generalized relationships for the maxima of those entanglement by exploiting the normalizer and normal subgroups of the physical symmetry group.
  arXiv  Detail & Related papers  (2020-11-30T02:21:22Z)
• MCMH: Learning Multi-Chain Multi-Hop Rules for Knowledge Graph Reasoning [46.68583750992613]
  We consider a generalized form of multi-hop rules, where each rule is a set of relation chains. We propose a two-step approach that first selects a small set of relation chains as a rule and then evaluates the confidence of the target relationship. Empirical results show that our multi-chain multi-hop (MCMH) rules result in superior results compared to the standard single-chain approaches.
  arXiv  Detail & Related papers  (2020-10-05T01:32:20Z)
• 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)
• Tighter constraints of multiqubit entanglement in terms of R\'{e}nyi-$\alpha$ entropy [5.316931601243777]
  monogamy and polygamy relations characterize the entanglement distributions in the multipartite systems. We present a class of monogamy inequalities related to the $mu$th power of the entanglement measure. These monogamy and polygamy relations are shown to be tighter than the existing ones.
  arXiv  Detail & Related papers  (2020-06-16T01:05:21Z)

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.