Entanglement witnesses arising from Choi type positive linear maps

We construct optimal PPTES witnesses to detect $3\otimes 3$ PPT entangled edge states of type $(6,8)$ constructed recently \cite{kye_osaka}. To do this, we consider positive linear maps which are variants of the Choi type map involving complex numbers, and examine several notions related to optimality for those entanglement witnesses. Through the discussion, we suggest a method to check the optimality of entanglement witnesses without the spanning property.Comment: 18 pages, 4 figures, 1 tabl

Facial structures for various notions of positivity and applications to the theory of entanglement

In this expository note, we explain facial structures for the convex cones consisting of positive linear maps, completely positive linear maps, decomposable positive linear maps between matrix algebras, respectively. These will be applied to study the notions of entangled edge states with positive partial transposes and optimality of entanglement witnesses.Comment: An expository note. Section 7 and Section 8 have been enlarge

Construction of 3⊗33\otimes 3 entangled edge states with positive partial transposes

We construct a class of $3\otimes 3$ entangled edge states with positive partial transposes using indecomposable positive linear maps. This class contains several new types of entangled edge states with respect to the range dimensions of themselves and their partial transposes.Comment: 14 page

Separability problem for multipartite states of rank at most four

One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most four which are PPT (i.e., all their partial transposes are positive semidefinite). We show that any PPT state of rank two or three is separable and has length at most four. For separable states of rank four, we show that they have length at most six. It is six only for some qubit-qutrit or multiqubit states. It turns out that any PPT entangled state of rank four is necessarily supported on a 3x3 or a 2x2x2 subsystem. We obtain a very simple criterion for the separability problem of the PPT states of rank at most four: such a state is entangled if and only if its range contains no product vectors. This criterion can be easily applied since a four-dimensional subspace in the 3x3 or 2x2x2 system contains a product vector if and only if its Pluecker coordinates satisfy a homogeneous polynomial equation (the Chow form of the corresponding Segre variety). We have computed an explicit determinantal expression for the Chow form in the former case, while such expression was already known in the latter case.Comment: 19 page

A922 Sequential measurement of 1 hour creatinine clearance (1-CRCL) in critically ill patients at risk of acute kidney injury (AKI)

Meeting abstrac