Characterization of $k$-positive maps

• URL: http://arxiv.org/abs/2104.14058v5
• Date: Fri, 9 Aug 2024 20:39:25 GMT
• Title: Characterization of $k$-positive maps
• Authors: Marcin Marciniak, Tomasz Młynik, Hiroyuki Osaka,
• Abstract summary: We construct a family of positive maps between matrix algebras of different dimensions depending on a parameter. The estimate bounds on the parameter to obtain the $k$-positivity are better than those derived from the spectral conditions considered by Chru'sci'nski and Kossakowski.
• Score: 0.6827423171182154
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a general characterization of k-positivity for a positive map in terms of the estimation of the Ky Fan norm of the matrix constructed from the Kraus operators of the associated completely positive map. Combining this with the result given by Takasaki and Tomiyama we construct a family of positive maps between matrix algebras of different dimensions depending on a parameter. The estimate bounds on the parameter to obtain the $k$-positivity are better than those derived from the spectral conditions considered by Chru\'sci\'nski and Kossakowski. We further look with special attention at the case where we give the precise bound for the regions of decomposability.

Related papers

• Quantum Reference Frames on Homogeneous Spaces [0.0]
  Properties of operator-valued integration are first studied and then employed to define general relativization maps and show their properties. The relativization maps presented here are defined for QRFs based on arbitrary homogeneous spaces of locally compact second countable topological groups.
  arXiv  Detail & Related papers  (2024-09-11T12:44:34Z)
• 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)
• Conditional Optimal Transport on Function Spaces [53.9025059364831]
  We develop a theory of constrained optimal transport problems that describe block-triangular Monge maps. This generalizes the theory of optimal triangular transport to separable infinite-dimensional function spaces with general cost functions. We present numerical experiments that demonstrate the computational applicability of our theoretical results for amortized and likelihood-free inference of functional parameters.
  arXiv  Detail & Related papers  (2023-11-09T18:44:42Z)
• Intrinsic Bayesian Cramér-Rao Bound with an Application to Covariance Matrix Estimation [49.67011673289242]
  This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a smooth manifold. It induces a geometry for the parameter manifold, as well as an intrinsic notion of the estimation error measure.
  arXiv  Detail & Related papers  (2023-11-08T15:17:13Z)
• Quantitative deterministic equivalent of sample covariance matrices with a general dependence structure [0.0]
  We prove quantitative bounds involving both the dimensions and the spectral parameter, in particular allowing it to get closer to the real positive semi-line. As applications, we obtain a new bound for the convergence in Kolmogorov distance of the empirical spectral distributions of these general models.
  arXiv  Detail & Related papers  (2022-11-23T15:50:31Z)
• Order preserving maps on quantum measurements [1.2891210250935143]
  We study the equivalence classes of quantum measurements endowed with the post-processing partial order. We map this set into a simpler partially ordered set using an order preserving map and investigating the resulting image.
  arXiv  Detail & Related papers  (2022-02-01T19:50:47Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Hilbert-space geometry of random-matrix eigenstates [55.41644538483948]
  We discuss the Hilbert-space geometry of eigenstates of parameter-dependent random-matrix ensembles. Our results give the exact joint distribution function of the Fubini-Study metric and the Berry curvature. We compare our results to numerical simulations of random-matrix ensembles as well as electrons in a random magnetic field.
  arXiv  Detail & Related papers  (2020-11-06T19:00:07Z)
• Diagonal unitary and orthogonal symmetries in quantum theory [1.5229257192293197]
  We show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.
  arXiv  Detail & Related papers  (2020-10-15T17:25:38Z)
• Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants [94.46276668068327]
  In [1], an ensemble of randomly projected linear discriminants is used to classify datasets. We develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator. We also demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.
  arXiv  Detail & Related papers  (2020-04-17T12:47:04Z)
• Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Discrete Distributions [63.60499266361255]
  We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically, profile entropy a) determines the speed of estimating the distribution relative to the best natural estimator; b) characterizes the rate of inferring all symmetric properties compared with the best estimator over any label-invariant distribution collection; c) serves as the limit of profile compression.
  arXiv  Detail & Related papers  (2020-02-26T17:49:04Z)

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.