Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1912.02381 · International Journal of Quantum Information

A factorization property of positive maps on C*-algebras

B. V. Rajarama Bhat, Hiroyuki Osaka

Published Aug 1, 2020• 6 citations
arXivHTMLPDF

Abstract

The purpose of this short paper is to clarify and present a general version of an interesting observation by [Piani and Mora, Phys. Rev. A 75 (2007) 012305], linking complete positivity of linear maps on matrix algebras to decomposability of their ampliations. Let [Formula: see text], [Formula: see text] be unital C*-algebras and let [Formula: see text] be positive linear maps from [Formula: see text] to [Formula: see text] [Formula: see text]. We obtain conditions under which any positive map [Formula: see text] from the minimal C*-tensor product [Formula: see text] to [Formula: see text], such that [Formula: see text], factorizes as [Formula: see text] for some positive map [Formula: see text]. In particular, we show that when [Formula: see text] are completely positive (CP) maps for some Hilbert spaces [Formula: see text] [Formula: see text], and [Formula: see text] is a pure CP map and [Formula: see text] is a CP map so that [Formula: see text] is also CP, then [Formula: see text] for some CP map [Formula: see text]. We show that a similar result holds in the context of positive linear maps when [Formula: see text] and [Formula: see text]. As an application, we extend IX Theorem of Ref. 4 (revisited recently by [Huber et al., Phys. Rev. Lett. 121 (2018) 200503]) to show that for any linear map [Formula: see text] from a unital C*-algebra [Formula: see text] to a C*-algebra [Formula: see text], if [Formula: see text] is decomposable for some [Formula: see text], where [Formula: see text] is the identity map on the algebra [Formula: see text] of [Formula: see text] matrices, then [Formula: see text] is CP.

DOI
10.1142/s0219749920500197

Related papers

Complete Positivity of Two Class of Maps Involving Depolarizing and Transpose-Depolarizing Channels

Xiu-Hong Sun, Yuan Li

In this note, we mainly study the necessary and sufficient conditions for the complete positivity of generalizations of depolarizing and transpose-depolarizing channels. Specifically, we define [Formula: see text] and [Formula: see text], where [Formula: see text] (the set of all bounded linear operators on the finite-dimensional Hilbert space [Formula: see text] is given and [Formula: see text] is the transpose of [Formula: see text] in a fixed orthonormal basis of [Formula: see text] First, we show that [Formula: see text] is completely positive if and only if [Formula: see text] is a positive map, which is equivalent to [Formula: see text] Moreover, [Formula: see text] is a completely positive map if and only if [Formula: see text] and [Formula: see text] At last, we also get that [Formula: see text] is a completely positive map if and only if [Formula: see text] with [Formula: see text] for all [Formula: see text] where [Formula: see text] are eigenvalues of [Formula: see text].

Open Systems & Information Dynamics•Jun 1, 2021•2 citations

Choi matrices revisited

Seung-Hyeok Kye

A linear map between matrix algebras corresponds to the Choi matrix in the tensor product of two matrix algebras whose definition depends on matrix units. Paulsen and Shultz [J. Math. Phys. 54, 072201 (2013)] considered the question if one can replace matrix units by another basis of matrix algebras in the definition of the Choi matrix to retain the correspondence between the complete positivity of maps and the positivity of Choi matrices and gave a sufficient condition on basis under which this is true. In this note, we provide necessary and sufficient conditions to see that the Paulsen–Shultz condition is also necessary.

arXiv:2206.09324•Journal of Mathematical Physics•Sep 1, 2022•9 citations

Completely Positive Matrix Products

Eric Evert, Michael T. Jury, Scott McCullough

Building on recent works that investigate positivity preserving matrix products, we {examine} the class of \JCP (\jcp) matrix products. A bilinear map on the Cartesian product of the space of n by n matrices with itself into m by m matrices is a \jcp matrix product if the natural linear map it induces on the tensor product of the space of n by n matrices with itself into m by m matrices is completely positive. In particular, a matrix product is \jcp if and only if its naturally associated Choi matrix is positive semidefinite. Similarly, a matrix product is \jcp if and only if it admits a Choi-Kraus representation. We use the Choi-Kraus representation of \jcp matrix products to study various basic properties, including positivity lower bounds, commutativity, units, causality, and separability. As examples, we apply our results to the Schur (Hadamard) product and the convolution product.

arXiv:2607.13251•Jul 14, 2026•1 citation

There Are Many More Positive Maps Than Completely Positive Maps

Igor Klep, Scott McCullough, Klemen Šivic +1 more

Abstract A $\ast$-linear map $\Phi$ between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations $I_n\otimes \Phi$ are positive. In this article, quantitative bounds on the fraction of positive maps that are completely positive are proved. A main tool is the real algebraic geometry techniques developed by Blekherman to study the gap between positive polynomials and sums of squares. Finally, an algorithm to produce positive maps that are not completely positive is given.

arXiv:1611.02838•International Mathematics Research Notices•Aug 8, 2017•12 citations

k-Positive Maps: New Characterizations and a Generation Method

Frederik vom Ende, Sumeet Khatri, Sergey Denisov

We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.

arXiv:2508.21348•Open Systems & Information Dynamics•Dec 1, 2025•3 citations

Positivity of linear maps under tensor powers

Alexander Müller‐Hermes, David Reeb, Michael M. Wolf

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.

arXiv:1502.05630•Journal of Mathematical Physics•Jul 23, 2015•53 citations
The purpose of this short paper is to clarify and present a general version of an interesting observation by [Piani and Mora, Phys. Rev. A 75 (2007) 012305], linking complete positivity of linear maps on matrix algebras to decomposability of their ampliations. Let [Formula: see text], [Formula: see text] be unital C*-algebras and let [Formula: see text] be positive linear maps from [Formula: see text] to [Formula: see text] [Formula: see text]. We obtain conditions under which any positive map [Formula: see text] from the minimal C*-tensor product [Formula: see text] to [Formula: see text], such that [Formula: see text], factorizes as [Formula: see text] for some positive map [Formula: see text]. In particular, we show that when [Formula: see text] are completely positive (CP) maps for some Hilbert spaces [Formula: see text] [Formula: see text], and [Formula: see text] is a pure CP map and [Formula: see text] is a CP map so that [Formula: see text] is also CP, then [Formula: see text] for some CP map [Formula: see text]. We show that a similar result holds in the context of positive linear maps when [Formula: see text] and [Formula: see text]. As an application, we extend IX Theorem of Ref. 4 (revisited recently by [Huber et al., Phys. Rev. Lett. 121 (2018) 200503]) to show that for any linear map [Formula: see text] from a unital C*-algebra [Formula: see text] to a C*-algebra [Formula: see text], if [Formula: see text] is decomposable for some [Formula: see text], where [Formula: see text] is the identity map on the algebra [Formula: see text] of [Formula: see text] matrices, then [Formula: see text] is CP.
In this note, we mainly study the necessary and sufficient conditions for the complete positivity of generalizations of depolarizing and transpose-depolarizing channels. Specifically, we define [Formula: see text] and [Formula: see text], where [Formula: see text] (the set of all bounded linear operators on the finite-dimensional Hilbert space [Formula: see text] is given and [Formula: see text] is the transpose of [Formula: see text] in a fixed orthonormal basis of [Formula: see text] First, we show that [Formula: see text] is completely positive if and only if [Formula: see text] is a positive map, which is equivalent to [Formula: see text] Moreover, [Formula: see text] is a completely positive map if and only if [Formula: see text] and [Formula: see text] At last, we also get that [Formula: see text] is a completely positive map if and only if [Formula: see text] with [Formula: see text] for all [Formula: see text] where [Formula: see text] are eigenvalues of [Formula: see text].
A linear map between matrix algebras corresponds to the Choi matrix in the tensor product of two matrix algebras whose definition depends on matrix units. Paulsen and Shultz [J. Math. Phys. 54, 072201 (2013)] considered the question if one can replace matrix units by another basis of matrix algebras in the definition of the Choi matrix to retain the correspondence between the complete positivity of maps and the positivity of Choi matrices and gave a sufficient condition on basis under which this is true. In this note, we provide necessary and sufficient conditions to see that the Paulsen–Shultz condition is also necessary.
Building on recent works that investigate positivity preserving matrix products, we {examine} the class of \JCP (\jcp) matrix products. A bilinear map on the Cartesian product of the space of n by n matrices with itself into m by m matrices is a \jcp matrix product if the natural linear map it induces on the tensor product of the space of n by n matrices with itself into m by m matrices is completely positive. In particular, a matrix product is \jcp if and only if its naturally associated Choi matrix is positive semidefinite. Similarly, a matrix product is \jcp if and only if it admits a Choi-Kraus representation. We use the Choi-Kraus representation of \jcp matrix products to study various basic properties, including positivity lower bounds, commutativity, units, causality, and separability. As examples, we apply our results to the Schur (Hadamard) product and the convolution product.
Abstract A ∗\ast∗-linear map Φ\PhiΦ between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations In⊗ΦI_n\otimes \PhiIn​⊗Φ are positive. In this article, quantitative bounds on the fraction of positive maps that are completely positive are proved. A main tool is the real algebraic geometry techniques developed by Blekherman to study the gap between positive polynomials and sums of squares. Finally, an algorithm to produce positive maps that are not completely positive is given.
We study [Formula: see text]-positive linear maps on matrix algebras and address two problems, (i) characterizations of [Formula: see text]-positivity and (ii) generation of nondecomposable [Formula: see text]-positive maps. On the characterization side, we derive optimization-based conditions equivalent to [Formula: see text]-positivity that (a) reduce to a simple check when [Formula: see text], (b) reveal a direct link to the spectral norm of certain order-3 tensors (aligning with known NP-hardness barriers for [Formula: see text]), and (c) recast [Formula: see text]-positivity as a novel optimization problem over separable states, thereby connecting it explicitly to separability testing. On the generation side, we introduce a Lie-semigroup-based method that, starting from a single [Formula: see text]-positive map, produces one-parameter families that remain [Formula: see text]-positive and nondecomposable for small enough times. We illustrate this by generating such families for [Formula: see text] and [Formula: see text]. We also formulate a semidefinite program (SDP) to test an equivalent form of the positive partial transpose (PPT) square conjecture (and do not find any violation of the latter). Our results provide practical computational tools for certifying [Formula: see text]-positivity and a systematic way to sample [Formula: see text]-positive nondecomposable maps.
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with n copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every n ∈ ℕ, there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all n. For higher dimensions, we reduce the existence question of such non-trivial “tensor-stable positive maps” to a one-parameter family of maps and show that an affirmative answer would imply the existence of non-positive partial transpose bound entanglement. As an application, we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We, furthermore, show that the latter is an upper bound even for the local operations and classical communications-assisted quantum capacity, and that moreover it is a strong converse rate for this task.