Drawing on results of Choi, Størmer and Woronowicz, we present a nearly complete characterization of certain important classes of positive maps. In particular, we construct a general class of positive linear maps acting between two matrix algebras ℬ( ) and ℬ( ), where and are finite-dimensional Hilbert spaces. It turns out that elements of this class are characterized by operators from the dual cone of the set of all separable states on ℬ( ⊗ ). Subsequently, the relation between entanglements and positive maps is described. Finally, a new characterization of the cone ℬ( ) + ⊗ℬ( ) + is given.
An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra has been presented. The premise of the proof is the identification of positive maps with operators preserving the Lorentz cone in four dimensions, and it allows to decompose the positive maps with respect to those preserving the boundary of the cone. In addition, useful conditions implying complete positivity of a map of have been given, together with a sufficient condition for complete positivity of an extremal Schwarz map of . Lastly, following the same geometrical approach, a description in topological terms of maps that are simultaneously completely positive and completely copositive has been presented.
The minimal operator systems over
Matk(C)+,
k⩾2, and the Lorentz cones
Lm,
m⩾4, are not subhomogeneous. For the
2×2 cone we construct extreme positive maps of arbitrarily large output dimension. Positive retracts give the remaining cases. Equivalently, for fixed
k⩾2 and
d, there exist
s>d and an entangled positive operator on
Ck⊗Cs such that every compression of the second factor to
Cd is separable.
A new proof is presented of a theorem of L. Gurvits [LANL Unclassified Technical Report (2001), LAUR–01–2030], which states that the cone of positive block-Toeplitz matrices with matrix entries has no entangled elements. The proof of the Gurvits separation theorem is achieved by making use of the structure of the operator system dual of the operator system C ( S 1 ) ( n ) C(S^1)^{(n)} of n × n n\times n Toeplitz matrices over the complex field, and by determining precisely the structure of the generators of the extremal rays of the positive cones of the operator systems C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)^{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) and C ( S 1 ) ( n ) ⊗ min B ( H ) C(S^1)_{(n)}\otimes _{\text {min}}\mathcal {B}(\mathcal {H}) , where H \mathcal {H} is an arbitrary Hilbert space and C ( S 1 ) ( n ) C(S^1)_{(n)} is the operator system dual of C
It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.
Dvoretzky's theorem and the complexity of entanglement detection, Discrete Analysis 2017:1, 20 pp. Let
H be a Hilbert space. A _state_ on
H is a linear operator
ρ:H→H such that tr
(ρ)=1 and tr
(ρP)≥0 for every orthogonal projection
P. A linear operator satisfying just the second condition is called _positive_. If
H=H1⊗H2 then an important piece of information about
ρ is the extent to which it can be split up into a part that acts on
H1 and a part that acts on
H2. An appropriate formal definition is the following: we say that
ρ is _separable_ if it can be approximated in the trace-class norm by operators of the form
∑iciρi1⊗ρi2, where each
ρi1 is a state on
H1, each
ρi2 is a state on
H2, and the
ci are positive constants. An operator that is not separable is called _entangled_. Owing to the importance of entanglement, it is useful to have a criterion that detects it. A simple necessary condition is that if
Φ is a linear map from operators to operators that takes positive operators to positive operators, and if
ρ is separable, then
(Φ⊗I)ρ is a positive operator: that is simply because
(Φ⊗I)(∑iciρi1⊗ρi2)=∑iciΦρi1⊗ρi2 and each
Φρi1 is positive. Interestingly, however, the converse is true: if
ρ is entangled, then there exists a positive
Φ such that
(Φ⊗I)(ρ) is _not_ positive. This equivalence is called the _Horodecki criterion_ for entanglement. The Horodecki criterion gives us a witness
Φ for each entangled state
ρ. The starting question for this paper is how many different witnesses one needs to detect all entangled states (as a function of the dimensions of
H1 and
H2). More precisely, since this number is known to be infinite, the paper considers the stronger notion of _robustly_ entangled states, which are states that remain entangled even when you average them with a suitable multiple of the identity. The main result of the paper is that the number needed is large: the authors obtain a bound of
exp(cd3/logd). A key observation that enables them to prove this is that there is a resemblance between the problem they are considering and a result from a famous paper of Figiel, Lindenstrauss and Milman concerning Dvoretzky's theorem [1]. It follows from the analysis in the FLM paper that the product of the logarithm of the number of faces of a symmetric convex body with the logarithm of the number of vertices has to be at least
cn, so it is not possible for a symmetric convex body to have few faces and few vertices (in strong contrast with a general convex body, since an
n-dimensional simplex has
n+1 of each). Something like that occurs here. Roughly speaking, the set of separable states can be regarded as having "few" extreme points, and therefore "many" faces. A single witness
Φ cannot help with too many faces, so the number of witnesses needed must be large. These interesting ideas are new to the field of quantum information. [1] T. Figiel, J. Lindenstrauss and V. D. Milman, _The dimension of almost spherical sections of convex bodies,_ Acta Math. 139 (1-2) (1977), pp. 53-94.