--- title: Bi-PPT State in Quantum Systems url: https://www.emergentmind.com/topics/bi-ppt-state type: topic --- # Bi-PPT State in Quantum Systems A bi-PPT state is, in the standard finite-dimensional bipartite sense, a state \(\rho\) on \(\mathcal{H}_A \otimes \mathcal{H}_B\) whose partial transpose is positive semidefinite. If \(\rho = \sum_{i,j,k,l}\rho_{ij,kl}\,|i\rangle_A\langle k| \otimes |j\rangle_B\langle l|\), then the partial transpose on \(B\) is \[ \rho^{T_B}=\sum_{i,j,k,l}\rho_{ij,kl}\,|i\rangle_A\langle k|\otimes |l\rangle_B\langle j|, \] and \(\rho\) is PPT precisely when \(\rho^{T_B}\ge 0\); otherwise it is NPT. In \(2\otimes 2\) and \(2\otimes 3\), PPT is equivalent to separability, whereas in higher dimensions PPT is only necessary, and PPT entangled states occur. The term also acquires more specialized meanings in later literatures, including multipartite bipartition-PPT states, absolutely PPT states, and bi-PPT channels, but the core object is the bipartite positive-partial-transpose state [1101.5134]. ## 1. Definition, ranks, and the PPT–NPT dichotomy For a bipartite state \(\rho\), the reduced operators \[ \rho_A=\operatorname{Tr}_B(\rho),\qquad \rho_B=\operatorname{Tr}_A(\rho) \] have ranks \(r_A=\operatorname{rank}(\rho_A)\) and \(r_B=\operatorname{rank}(\rho_B)\), while \(r=\operatorname{rank}(\rho)\) is the global rank. Chen and Đoković use the notation “\(M\times N\) state” for a state with \(\operatorname{rank}(\rho_A)=M\) and \(\operatorname{rank}(\rho_B)=N\); this refers to local ranks, not necessarily the ambient Hilbert-space dimensions [1101.5134]. Distillability is formulated through the partial transpose. A state is 1-distillable if there exists a pure state \(|\psi\rangle\) of Schmidt rank 2 such that \[ \langle \psi|\rho^{T_B}|\psi\rangle<0. \] More generally, \(\rho\) is \(n\)-distillable if \(\rho^{\otimes n}\) is 1-distillable, and PPT states are never distillable by LOCC. A PPT entangled state is therefore a bound entangled state. This makes the PPT/NPT boundary the operational dividing line between guaranteed nondistillability and possible distillability in the bipartite setting [1101.5134]. The same positivity notion admits refinements. In \(2\otimes N\), a state can be SPPT (“strong PPT”) if positivity of the partial transpose is recognized directly from a canonical block-Cholesky factorization; for these systems, vanishing discord on the qubit side implies SPPT, and any PPT state that is not SPPT necessarily has nonzero discord [1004.0434]. This does not redefine PPT, but it exhibits a structurally stronger subclass. ## 2. Low-rank bi-PPT states and the distillability threshold A central structural result for bipartite PPT theory is that low global rank strongly constrains both separability and distillability. Before Chen and Đoković, it was known that if \[ r<\max\{r_A,r_B\}, \] then \(\rho\) is distillable. Their main extension shows that if \(r=\max\{r_A,r_B\}\) and \(\rho\) is NPT, then \(\rho\) is still distillable; in the \(M\times N\) formulation with \(M\le N\), every NPT state of rank \(N\) is 1-distillable. In particular, any \(M\times M\) NPT state of rank \(M\) is distillable, resolving the conjectured symmetric case, and all rank-3 entangled states are distillable [1101.5134]. Combining this theorem with earlier low-rank PPT results yields a sharp classification in the regime \[ r\le \max\{r_A,r_B\}. \] In that regime, PPT and separability coincide, while NPT and distillability coincide. Equivalently, there are no PPT entangled states and no NPT bound entangled states at ranks up to the maximal local rank. This is a rank-constrained extension of the familiar \(2\otimes 2\) and \(2\otimes 3\) Peres–Horodecki sufficiency regime, but now expressed in terms of ranks rather than local dimensions alone [1101.5134]. For qubit–qudit systems, birank language makes this especially explicit. If \(r=\operatorname{rank}(\rho)\) and \(s=\operatorname{rank}(\rho^\Gamma)\), then \((r,s)\) is the birank. In \(2\otimes 3\), the length of a separable state is exactly \(\max(r,s)\), and examples exist for every feasible birank. More generally, any qubit–qudit separable state of birank \((d+1,d+1)\) has length \(d+1\), while any qubit–qudit PPT entangled state of birank \((d+1,d+1)\) can be built from edge states [1210.0111]. ## 3. Rank-4 classification, range criteria, and generalized UPBs Rank 4 is the first nontrivial rank at which PPT entanglement appears in the bipartite theory. Chen and Đoković prove a complete separability criterion for arbitrary bipartite rank-4 states: \[ \rho \text{ is separable } \iff \rho^{T_B}\ge 0 \text{ and } \mathcal{R}(\rho)\text{ contains at least one product vector}. \] Thus, for rank 4, the trichotomy is exact: PPT plus a product vector in the range implies separability; PPT with no product vector in the range implies PPT entanglement; NPT implies distillability [1101.5134]. The decisive object here is the range \(\mathcal{R}(\rho)\). If \(\mathcal{R}(\rho)\) contains no product vector, it is a completely entangled subspace. In \(3\otimes 3\), the canonical rank-4 PPT entangled examples are precisely of this kind, including states derived from unextendible product bases (UPBs), whose ranges are orthogonal complements of UPBs and therefore product-free [1101.5134]. This range-based picture is refined by the UPB classification of low-rank extremal PPT states. In \(3\otimes 3\), a rank-4 entangled PPT state belongs to a continuous family related by non-singular product transformations; its kernel carries a generalized UPB, meaning a basis of product vectors not necessarily orthogonal, with no product vector in the image. The generalized UPB has the special property that it can be transformed to orthogonal form by a product transformation. The paper gives a complete parametrization of orthogonal \(3\otimes 3\) UPBs and presents strong numerical evidence that this parametrizes all rank-4 entangled extremal PPT states in \(3\otimes 3\) [1003.1221]. A particularly important structured family is the checkerboard family of \(3\times 3\) rank-4 states. Chen and Đoković prove that all NPT checkerboard states are 1-distillable. Within that family, NPT and distillability coincide, while the PPT members are PPT entangled rank-4 states with completely entangled range [1101.5134]. ## 4. Geometric and extremal structure of the PPT set The set of density operators is a convex compact body, and PPT states define a convex subset within it. A geometric description due to Hilbert–Schmidt distance from the maximally mixed state places PPT, separable, and distillable regions in nested shells. For an \(n\)-qudit bipartite system with total dimension \(N=d^n\), every state within distance \[ \frac{1}{\sqrt{\sqrt{d^n(d^n-1)}+1}} \] from \(\mathds{I}_N/N\) is necessarily PPT, whereas all states within distance \[ \frac{R}{1+d^{\,n-1}},\qquad R=\sqrt{\frac{d^n-1}{d^n}}, \] are necessarily separable. Since the separable radius is strictly smaller than the PPT radius, there is a nonempty shell in which states are PPT but not forced to be separable; in higher dimensions this shell contains PPT bound entangled states [1708.03885]. Extremal PPT states organize the boundary geometry of the PPT set. For a bipartite \(M\times N\) system, Let \(E\) denote the set of extreme points of the compact convex set of PPT states, with \(E_r^{M,N}\) the subset of rank-\(r\) extreme states with full local ranks \(M\) and \(N\). It is known that \(E_1\) is the set of pure product states, and that \(E_r^{M,N}\) is empty for \(1