Superior monogamy and polygamy relations and estimates of concurrence
- URL: http://arxiv.org/abs/2503.00694v1
- Date: Sun, 02 Mar 2025 02:25:34 GMT
- Title: Superior monogamy and polygamy relations and estimates of concurrence
- Authors: Yue Cao, Naihuan Jing, Kailash Misra, Yiling Wang,
- Abstract summary: 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.
- Score: 6.408200192709026
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: It is well known that any well-defined bipartite entanglement measure $\mathcal{E}$ obeys $\gamma$th-monogamy relations Eq. (1.1) and assisted measure $\mathcal{E}_{a}$ obeys $\delta$th-polygamy relations Eq. (1.2). Recently, we presented a class of tighter parameterized monogamy relation for the $\alpha$th $(\alpha\geq\gamma)$ power based on Eq. (1.1). This study provides a family of tighter lower (resp. upper) bounds of the monogamy (resp. polygamy) relations in a unified manner. In the first part of the paper, the following three basic problems are focused: (i) tighter monogamy relation for the $\alpha$th ($0\leq \alpha\leq \gamma$) power of any bipartite entanglement measure $\mathcal{E}$ based on Eq. (1.1); (ii) tighter polygamy relation for the $\beta$th ($ \beta \geq \delta$) power of any bipartite assisted entanglement measure $\mathcal{E}_{a}$ based on Eq. (1.2); (iii) tighter polygamy relation for the $\omega$th ($0\leq \omega \leq \delta$) power of any bipartite assisted entanglement measure $\mathcal{E}_{a}$ based on Eq. (1.2). In the second part, using the tighter polygamy relation for the $\omega$th ($0\leq \omega \leq 2$) power of CoA, we obtain good estimates or bounds for the $\omega$th ($0\leq \omega \leq 2$) power of concurrence for any $N$-qubit pure states $|\psi\rangle_{AB_{1}\cdots B_{N-1}}$ under the partition $AB_{1}$ and $B_{2}\cdots B_{N-1}$. Detailed examples are given to illustrate that our findings exhibit greater strength across all the region.
Related papers
- 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)
We also prove a new polygamy relation of multiqubit quantum entanglement in terms of $G_omega$-concurrence of assistance ($G_omega$CoA)
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) - 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) - Monogamy and polygamy for multi-qudit generalized $W$-class states based on concurrence of assistance and Tsallis-$q$ entanglement of assistance [1.125136513287558]
We present new analytical monogamy inequalities satisfied by the $alpha$-th ($alphageqgamma,gammageq2$) power.<n>We also establish new monogamy and polygamy relations, which are shown to be valid even for multipartite higher-dimensional states.
arXiv Detail & Related papers (2025-02-17T07:56:06Z) - Unified monogamy relations for the generalized $W$-class states beyond qubits [1.125136513287558]
We study monogamy relations with respect to partitions for the generalized $W$-class (GW) states based on the unified-($q,s$) entanglement (UE)
We provide the monogamy relation based on the squared UE for a reduced density matrix of a qudit GW state, as well as tighter monogamy relations based on the $alpha$th ($alphageq2$) power of UE.
arXiv Detail & Related papers (2024-11-16T08:44:50Z) - Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input.
We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
arXiv Detail & Related papers (2024-02-23T12:22:03Z) - $\ell_p$-Regression in the Arbitrary Partition Model of Communication [59.89387020011663]
We consider the randomized communication complexity of the distributed $ell_p$-regression problem in the coordinator model.
For $p = 2$, i.e., least squares regression, we give the first optimal bound of $tildeTheta(sd2 + sd/epsilon)$ bits.
For $p in (1,2)$,we obtain an $tildeO(sd2/epsilon + sd/mathrmpoly(epsilon)$ upper bound.
arXiv Detail & Related papers (2023-07-11T08:51:53Z) - The Approximate Degree of DNF and CNF Formulas [95.94432031144716]
For every $delta>0,$ we construct CNF and formulas of size with approximate degree $Omega(n1-delta),$ essentially matching the trivial upper bound of $n.
We show that for every $delta>0$, these models require $Omega(n1-delta)$, $Omega(n/4kk2)1-delta$, and $Omega(n/4kk2)1-delta$, respectively.
arXiv Detail & Related papers (2022-09-04T10:01:39Z) - Monogamy of entanglement between cones [68.8204255655161]
We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones.
Our proof makes use of a new characterization of products of simplices up to affine equivalence.
arXiv Detail & Related papers (2022-06-23T16:23:59Z) - 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) - Low-degree learning and the metric entropy of polynomials [44.99833362998488]
We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
arXiv Detail & Related papers (2022-03-17T23:52:08Z) - 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) - Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample
Complexity [59.34067736545355]
Given an MDP with $S$ states, $A$ actions, the discount factor $gamma in (0,1)$, and an approximation threshold $epsilon > 0$, we provide a model-free algorithm to learn an $epsilon$-optimal policy.
For small enough $epsilon$, we show an improved algorithm with sample complexity.
arXiv Detail & Related papers (2020-06-06T13:34:41Z) - Monogamy relations and upper bounds for the generalized $W$-class states
using R\'{e}nyi-$\alpha$ entropy [0.0]
We investigate monogamy relations and upper bounds for generalized $W$-class states related to the R'enyi-$alpha$ entropy.
We apply our results into quantum games and present a new bound of the nonclassicality of quantum games restricting to generalized $W$-class states.
arXiv Detail & Related papers (2020-04-30T09:27:40Z)
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.