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:math-ph/0406010 · Open Systems & Information Dynamics

A Simple Proof of the Jamiołkowski Criterion for Complete Positivity of Linear Maps

David Cienfuegos Salgado, J. L. Sánchez‐Gómez, Miguel Ferrero

Published Mar 1, 2005• 15 citations
arXivHTMLPDF

Abstract

We give a simple direct proof of the Jamiołkowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accessible for physicists than other ones found in the literature and provides a systematic method to give any set of Kraus matrices of the Kraus decomposition.
DOI
10.1007/s11080-005-0486-2

Related papers

A simple proof of the Jamiolkowski criterion for complete positivity of linear maps of algebras of Hilbert-Schmidt operators

Salgado, D., J. L. Sánchez‐Gómez

We generalize a preceding simple proof of the Jamiolkowski criterion to check whether a given linear map between algebras of operators is completely positive or not. The generalization is performed to embrace all algebras of Hilbert-Schmidt class operators, thus possibly infinite-dimensional.

arXiv:math-ph/0411074•Nov 24, 2004•1 citation

The Jamiołkowski Isomorphism and a Simplified Proof for the Correspondence Between Vectors Having Schmidt Number k and k-Positive Maps

Kedar S. Ranade, Mazhar Ali

Positive maps which are not completely positive are used in quantum information theory as witnesses for convex sets of states, in particular as entanglement witnesses and, more generally, as witnesses for states having Schmidt number not greater than k. Such maps and witnesses are related to k-positive maps, and their properties may be investigated by making use of the Jamiołkowski isomorphism. In this article we review the properties of this isomorphism, noting that there are actually two related mappings bearing that name. As a new result, we give a simplified proof for the correspondence between vectors having Schmidt number k and k-positive maps and thus for the Jamiołkowski criterion for complete positivity. Another consequence is a special case of a result by Choi, namely that k-positivity implies complete positivity, if k is the dimension of the smaller one of the Hilbert spaces on which the operators act.

arXiv:quant-ph/0702255•Open Systems & Information Dynamics•Dec 1, 2007•17 citations

Fractional $k$-positivity: a continuous refinement of the $k$-positive scale

Mohsen Kian

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $α$-admissible unit vectors ($α\in[1,d]$), we define closed cones $\mathsf K_α$ of bipartite positive operators that interpolate strictly between successive Schmidt-number cones, together with their dual witness cones. Via the Choi--Jamiołkowski correspondence this yields a matching filtration of map cones $\mathsf P_α$, recovering the usual $k$-positive/$k$-superpositive classes at integer parameters and complete positivity at the top endpoint. Two results show that the fractional levels capture genuinely new structure. First, we prove a \emph{fractional Kraus theorem}: $α$-superpositive maps are precisely the completely positive maps admitting a Kraus decomposition whose Kraus operators satisfy an explicit singular-value (Ky--Fan) constraint, extending the classical rank-$k$ characterization. Second, for non-integer $α$ the cones $\mathsf P_α$ fail stability under CP post-composition, highlighting a sharp structural transition away from the integer theory. Finally, we derive sharp thresholds on canonical symmetric families (including the depolarizing ray and the isotropic slice), turning familiar stepwise criteria into continuous, computable profiles.

math.FACross-listedarXiv:2602.12729•Feb 16, 2026•1 citation

Evolution of any finite open quantum system always admits a Kraus-type representation, although it is not always completely positive

David Cienfuegos Salgado, J. L. Sánchez‐Gómez, Miguel Ferrero

We argue that a full account of the set of quantum states prevents one from applying the rigorous definition of complete positivity. However, we give three equivalent proofs that any quantum evolution of a finite system always admits a Kraus-type decomposition, i.e., a Kraus decomposition but with Kraus matrices dependent on the initial state upon which they apply.

Physical Review A•Nov 22, 2004•13 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
Positive maps which are not completely positive are used in quantum information theory as witnesses for convex sets of states, in particular as entanglement witnesses and, more generally, as witnesses for states having Schmidt number not greater than k. Such maps and witnesses are related to k-positive maps, and their properties may be investigated by making use of the Jamiołkowski isomorphism. In this article we review the properties of this isomorphism, noting that there are actually two related mappings bearing that name. As a new result, we give a simplified proof for the correspondence between vectors having Schmidt number k and k-positive maps and thus for the Jamiołkowski criterion for complete positivity. Another consequence is a special case of a result by Choi, namely that k-positivity implies complete positivity, if k is the dimension of the smaller one of the Hilbert spaces on which the operators act.
Fractional kkk-positivity: a continuous refinement of the kkk-positive scale
We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and kkk-positivity for maps between matrix algebras. Starting from a compact family of ααα-admissible unit vectors (α∈[1,d]α\in[1,d]α∈[1,d]), we define closed cones Kα\mathsf K_αKα​ of bipartite positive operators that interpolate strictly between successive Schmidt-number cones, together with their dual witness cones. Via the Choi--Jamiołkowski correspondence this yields a matching filtration of map cones Pα\mathsf P_αPα​, recovering the usual kkk-positive/kkk-superpositive classes at integer parameters and complete positivity at the top endpoint. Two results show that the fractional levels capture genuinely new structure. First, we prove a \emph{fractional Kraus theorem}: ααα-superpositive maps are precisely the completely positive maps admitting a Kraus decomposition whose Kraus operators satisfy an explicit singular-value (Ky--Fan) constraint, extending the classical rank-kkk characterization. Second, for non-integer ααα the cones Pα\mathsf P_αPα​ fail stability under CP post-composition, highlighting a sharp structural transition away from the integer theory. Finally, we derive sharp thresholds on canonical symmetric families (including the depolarizing ray and the isotropic slice), turning familiar stepwise criteria into continuous, computable profiles.
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.