2014.08.13 14:46
| 실적년도 | 2014년 |
|---|---|
| 논문구분 | 국외 |
| 총저자 | Kil-Chan Ha, Seung-Hyeok Kye |
| 학술지명 | Open Systems & Information Dynamics |
| 권(Vol.) | 21 |
| 호(No.) | |
| 게재년월 | 2014년 11월 |
| Impact Factor | 0.808(jcr2013) |
| SCI 등재 | |
| 비고 |
In the convex set of all $3 ⊗3$ states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the interior of the convex set of all separable states. In general, we need at least $mn$ extreme points to get an interior point by their convex combination, for the case of the convex set of all $m ⊗ n$ separable states. This shows a sharp distinction between PPT states and separable states. We also consider the same questions for positive maps and decomposable maps.