Polygamy relation of quantum correlations with equality
- URL: http://arxiv.org/abs/2309.13386v1
- Date: Sat, 23 Sep 2023 14:09:52 GMT
- Title: Polygamy relation of quantum correlations with equality
- Authors: Zhi-Xiang Jin, Bing Yu, Xue-Na Zhu, Shao-Ming Fei, Cong-Feng Qiao
- Abstract summary: A polygamy relation with equality is given by introducing the polygamy weight.
From the polygamy relation with equality, we present polygamy inequalities satisfied by the power of the quantum correlation measures.
- Score: 5.925000951196114
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We provide a generalized definition of polygamy relations for any quantum
correlation measures. Instead of the usual polygamy inequality, a polygamy
relation with equality is given by introducing the polygamy weight. From the
polygamy relation with equality, we present polygamy inequalities satisfied by
the $\beta$th $(\beta>0)$ power of the quantum correlation measures. Taking
concurrence of assistance as an example, we further illustrate the significance
and advantages of these relations. We also obtain a polygamy relation with
equality by considering the one-to-group entanglements for any quantum
entanglement measures that do not satisfy the polygamy relations. We
demonstrate that such relations for tripartite states can be generalized to
multipartite systems.
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) - Polygamy relations for tripartite and multipartite quantum systems [0.0]
We study the polygamy property for tripartite and multipartite quantum systems.
We use right triangle and tetrahedron to explain our polygamy relations according to the new definitions.
arXiv Detail & Related papers (2023-12-25T10:26:58Z) - General monogamy and polygamy relations of arbitrary quantum
correlations for multipartite systems [0.0]
General monogamy relations are presented for the $alpha$th $(0leqalpha leqgamma$, $gammageq2)$ power of quantum correlation.
General polygamy relations are given for the $beta$th $(betageq delta$, $0leqdeltaleq1)$ power of quantum correlation.
arXiv Detail & Related papers (2023-12-15T03:29:30Z) - Multipartite entanglement theory with entanglement-nonincreasing
operations [91.3755431537592]
We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication.
We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
arXiv Detail & Related papers (2023-05-30T12:53:56Z) - On monogamy and polygamy relations of multipartite systems [9.730815192305782]
We study the monogamy and polygamy relations related to quantum correlations for multipartite quantum systems.
It is known that any bipartite measure obeys monogamy and polygamy relations for the $r$-power of the measure.
arXiv Detail & Related papers (2023-02-16T19:11:51Z) - 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) - Tighter Constraints of Multipartite Systems in terms of General Quantum
Correlations [0.0]
We show that monogamy and polygamy relations are tighter than the existing ones.
Taking concurrence and the Tsallis-$q$ entanglement of assistance as examples, we show the advantages of our results.
arXiv Detail & Related papers (2022-02-04T17:33:16Z) - From partners to populations: A hierarchical Bayesian account of
coordination and convention [25.131987884154054]
We argue that the central computational problem of communication is not simply transmission, but learning and adaptation over multiple timescales.
We present new empirical data alongside simulations showing how our model provides a cognitive foundation for explaining several phenomena.
arXiv Detail & Related papers (2021-04-12T23:00:40Z) - 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) - Post-Quantum Multi-Party Computation [32.75732860329838]
We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries.
We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption.
Along the way, we develop cryptographic primitives that may be of independent interest.
arXiv Detail & Related papers (2020-05-23T00:42:52Z) - Novel Change of Measure Inequalities with Applications to PAC-Bayesian
Bounds and Monte Carlo Estimation [29.919144859026016]
We show how variational representation for $f$-divergences leads to novel change of measure inequalities.
We also present a multiplicative change of measure inequality for $alpha$-divergences and a generalized version of Hammersley-Chapman-Robbins inequality.
arXiv Detail & Related papers (2020-02-25T05:36:22Z)
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.