Generalizing Choi map in $M_3$ beyond circulant scenario

• URL: http://arxiv.org/abs/2212.03807v1
• Date: Wed, 7 Dec 2022 17:44:20 GMT
• Title: Generalizing Choi map in $M_3$ beyond circulant scenario
• Authors: Anindita Bera, Giovanni Scala, Gniewomir Sarbicki, and Dariusz Chru\'sci\'nski
• Abstract summary: We present a generalization of the family of linear positive maps in $M_3$ proposed thirty years ago by Cho and Co. The necessary and sufficient conditions for decomposability are provided.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a generalization of the family of linear positive maps in $M_3$ proposed thirty years ago by Cho et al. (Linear Algebra Appl. ${\bf 171}$, 213 (1992)) as a generalization of the seminal Choi non-decomposable map. The necessary and sufficient conditions for decomposability are provided.

Related papers

• Optimality of generalized Choi maps in $M_3$ [0.0]
  We investigate when generalized Choi maps are optimal, i.e. cannot be represented as a sum of positive and completely positive maps. This property is weaker than extremality, however, it turns out that it plays a key role in detecting quantum entanglement.
  arXiv  Detail & Related papers  (2023-12-05T14:57:11Z)
• Infinite dimensional analogues of Choi matrices [0.0]
  Choi matrices are useful to characterize positivity of maps as well as complete positivity. It turns out that such correspondences are possible for every normal completely bounded map if and only if the factor is of type I. We also define the notion of $k$-superpositive maps, which turns out to be equivalent to the property of $k$-partially entanglement breaking.
  arXiv  Detail & Related papers  (2023-11-30T04:15:29Z)
• Optimizing positive maps in the matrix algebra $M_n$ [0.0]
  We conjecture how to optimize a map $tau_n,k$ when $GCD(n,k)=2$ or 3. For $GCD(n,k)=2$, a series of analytical results are derived and for $GCD(n,k)=3$, we provide a suitable numerical analysis.
  arXiv  Detail & Related papers  (2023-09-18T09:47:55Z)
• $L^1$ Estimation: On the Optimality of Linear Estimators [64.76492306585168]
  This work shows that the only prior distribution on $X$ that induces linearity in the conditional median is Gaussian. In particular, it is demonstrated that if the conditional distribution $P_X|Y=y$ is symmetric for all $y$, then $X$ must follow a Gaussian distribution.
  arXiv  Detail & Related papers  (2023-09-17T01:45:13Z)
• Estimating Optimal Policy Value in General Linear Contextual Bandits [50.008542459050155]
  In many bandit problems, the maximal reward achievable by a policy is often unknown in advance. We consider the problem of estimating the optimal policy value in the sublinear data regime before the optimal policy is even learnable. We present a more practical, computationally efficient algorithm that estimates a problem-dependent upper bound on $V*$.
  arXiv  Detail & Related papers  (2023-02-19T01:09:24Z)
• Linear maps as sufficient criteria for entanglement depth and compatibility in many-body systems [0.0]
  We extend results presented in [Phys. Rev A 93, 042335], where sufficient separability criteria for bipartite systems were derived. We derive criteria to detect arbitrary $(N-n)$-entanglement depth tailored to states in close vicinity of the completely depolarized state. We also provide separability (or $1$- entanglement depth) conditions in the symmetric sector, including for diagonal states.
  arXiv  Detail & Related papers  (2022-11-05T10:42:24Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• A class of optimal positive maps in $M_n$ [0.0]
  It is proven that a certain class of positive maps in the matrix algebra $M_n$ consists of optimal maps. This class provides a generalization of a seminal Choi positive map in $M_3$.
  arXiv  Detail & Related papers  (2022-07-08T10:59:31Z)
• Supervised Training of Conditional Monge Maps [107.78770597815242]
  Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
  arXiv  Detail & Related papers  (2022-06-28T19:34:44Z)
• Neural Optimal Transport with General Cost Functionals [66.41953045707172]
  We introduce a novel neural network-based algorithm to compute optimal transport plans for general cost functionals. As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.
  arXiv  Detail & Related papers  (2022-05-30T20:00:19Z)
• Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
  Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector. We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
  arXiv  Detail & Related papers  (2020-06-12T10:21: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.