Computable lower bound of the parameterized entanglement monotone

• URL: http://arxiv.org/abs/2605.22165v1
• Date: Thu, 21 May 2026 08:35:02 GMT
• Title: Computable lower bound of the parameterized entanglement monotone
• Abstract summary: We investigate the lower bounds of two kinds of entanglement monotones, i.e., $q$-concurrence ($q>1$) and $$-concurrence ($01$)<n>We obtain, in the light of the informationally complete ($N$, $M$)-positive operator-valued measure [($N$, $M$)-POVM], the lower bounds for the case of $frac121$, $1q2$ for two-qudit states, and the case of $2leqslant q3$
• Score: 6.65363595844844
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate the lower bound of a given entanglement measure for an arbitrary quantum state. This results in a subject of intensive mathematical research. In particular, along this line, the lower bounds of concurrence or other measures that are induced from concurrence have been explored a lot. Here, we investigate the lower bounds of two kinds of entanglement monotones, i.e., $q$-concurrence ($q>1$) and $α$-concurrence ($0<α<1$), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete ($N$, $M$)-positive operator-valued measure [($N$, $M$)-POVM], the lower bounds for the case of $\frac12<α<1$, $1<q<2$ for two-qudit states, and the case of $2\leqslant q<3$ for two-qubit states. We list several examples which show that the lower bounds based on ($N$, $M$)-POVM outperform that of GSIC-POVM and SIC-POVM, and all these measurement based bounds are better then the ones induced by positive partial transpose (PPT) and realignment criteria in literature. In addition, we obtain an analytical formula of the parameterized entanglement monotone with $\frac12<α<1$ and $1<q<2$ for the isotropic state.

Related papers

• Quantifying Multipartite Entanglement Based on unified entropy [8.011717889271603]
  We show that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds.<n>We rigorously prove that when the parameters $q$ and $s$ are in certain ranges, $Ak_q,s()$ and $Gk_q,s()$ also satisfy monotonicity and strong monotonicity.
  arXiv  Detail & Related papers  (2026-08-24T00:54:24Z)
• Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions [51.50375419691955]
  Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty.<n>We study how many samples are necessary and sufficient to learn an $varepsilon$-optimal robust policy under the average-reward criterion.
  arXiv  Detail & Related papers  (2026-08-06T19:49:48Z)
• Optimal Dimension-Free Sampling for Regularized Classification [56.72526267755301]
  We prove optimal sampling bounds achieving $(1pmvarepsilon)$-relative error for a broad class of Lipschitz continuous classification loss functions.<n>This includes important functions such as logistic and sigmoid loss, hinge loss, and ReLU loss, as prominent and popular representative examples.
  arXiv  Detail & Related papers  (2026-05-22T15:05:33Z)
• Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale [54.65053906803857]
  We study the optimal scale at which real-valued function classes exhibit uniform convergence and learnability.<n>Our main result establishes a scale-sensitive generalization of the fundamental theorem of PAC learning.<n>We also highlight several open questions on quantitative sample complexity and evaluability.
  arXiv  Detail & Related papers  (2026-05-13T15:41:30Z)
• Hardness of High-Dimensional Linear Classification [58.29089693778071]
  We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem.<n>Both are fundamental problems in computational geometry and machine learning in their exact and approximate forms.
  arXiv  Detail & Related papers  (2026-03-19T15:53:41Z)
• Two-parameter bipartite entanglement measure [4.908885505207505]
  Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies.<n>We introduce a two- parameter family of entanglement measures, referred to as the unified $(q,s)$-concurrence.<n>Explicit expressions are obtained for the unified $(q,s)$-concurrence in the cases of isotropic and Werner states.
  arXiv  Detail & Related papers  (2026-01-30T05:09:31Z)
• A new entanglement measure based on the total concurrence [2.003078340059495]
  A bona fide measure of quantum entanglement is introduced, the $mathcalCt_q$-concurrence ($q geq 2$)<n>An analytical expression is derived for the $mathcalCt_q$-concurrence in the cases of isotropic and Werner states.<n>The monogamy relations that the $mathcalCt_q$-concurrence satisfies for qubit systems are examined.
  arXiv  Detail & Related papers  (2025-12-30T07:58:55Z)
• Quantifying multipartite quantum states by ($k+1$)-partite entanglement measures [2.150800093140658]
  We put forward two families of entanglement measures termed $q$-$(k+1)$-PE concurrence $(q>1)$ and $alpha$-$(k+1)$-PE concurrence $(0leqalpha1)$. We also propose two alternative kinds of entanglement measures, named $q$-$(k+1)$-GPE concurrence $(q>1)$ and $alpha$-$(k+1)$-GPE concurrence $(0leqalpha1)$.
  arXiv  Detail & Related papers  (2024-04-23T13:19:17Z)
• Parameterized multipartite entanglement measures [2.4172837625375]
  We present two types of entanglement measures in $n$-partite systems, $q$-$k$-ME concurrence $(qgeq2,2leq kleq n)$ and $alpha$-$k$-ME concurrence $(0leqalphaleqfrac12,2leq kleq n)$. Rigorous proofs show that the proposed $k$-nonseparable measures satisfy all the requirements for being an entanglement measure.
  arXiv  Detail & Related papers  (2023-08-31T01:58:47Z)
• Online Learning with Adversaries: A Differential-Inclusion Analysis [52.43460995467893]
  We introduce an observation-matrix-based framework for fully asynchronous online Federated Learning with adversaries. Our main result is that the proposed algorithm almost surely converges to the desired mean $mu.$ We derive this convergence using a novel differential-inclusion-based two-timescale analysis.
  arXiv  Detail & Related papers  (2023-04-04T04:32:29Z)
• Estimating Parameterized Entanglement Measure [2.9690504594380185]
  The $q$-concurrence is a reasonable parameterized entanglement measure. We present tight lower bounds of the $q$-concurrence for arbitrary $qgeqslant 2$.
  arXiv  Detail & Related papers  (2022-06-16T04:13:17Z)
• Optimal and instance-dependent guarantees for Markovian linear stochastic approximation [47.912511426974376]
  We show a non-asymptotic bound of the order $t_mathrmmix tfracdn$ on the squared error of the last iterate of a standard scheme. We derive corollaries of these results for policy evaluation with Markov noise.
  arXiv  Detail & Related papers  (2021-12-23T18:47:50Z)
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs [132.88757893161699]
  We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps. DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
  arXiv  Detail & Related papers  (2020-12-29T14:06:09Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)

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.