arXiv:2609.39141
Geometric Characterization and Feasible Region Analysis of Bipartite Qutrit Bound Entanglement
Mazhar Ali
Abstract
We characterize bound entanglement in bipartite qutrit systems by combining the Positive Partial Transpose (PPT) criterion with a structural, non-completely positive map. Focusing on a comprehensive three-parameter bipartite qutrit family $ρ_{a,b,c}$, we present an exact analytical and geometric partitioning of the physical state space simplex. We derive the closed-form quadratic boundary governing the leaf-like PPT region $(a^2+ab+b^2-b \leq 0)$ over the domain $0 < a \leq \frac{1}{3}$, and identify the exact linear threshold $(a > c)$ that characterizes the PPT bound entangled sub-region. This family strictly generalizes the well-known Horodecki bound entangled states, which appear as a single slice of the three-dimensional leaf. Applying the structural map to this decomposition, we show that it certifies bound entanglement throughout the entire threshold region, accounting for $14.76\%$ of the total PPT leaf area.
AI Summary
The paper studies the PPT and positive-map-detectable entanglement regions of a two-qutrit mixture $\rho_{a,b,c}=a|\Psi\rangle\langle\Psi|+b\sigma_++c\sigma_-$, where $|\Psi\rangle$ is maximally entangled, $\sigma_\pm$ are uniform mixtures of cyclically shifted product states, and $a,b,c\geq0$ with $a+b+c=1$. This family has two independent parameters and includes the Horodecki family on the slice $a=2/7$. Evaluating the partial-transpose spectrum gives the exact PPT condition $bc\geq a^2$. Eliminating $c$ yields $a^2+ab+b^2-b\leq0$, with $0\leq a\leq1/3$ and boundaries $b=(1-a\pm\sqrt{1-2a-3a^2})/2$. Applying a previously established indecomposable positive map gives a negative eigenvalue whenever $a>c$, equivalently $b>1-2a$. States satisfying this inequality within the PPT region are therefore certified bound entangled. The paper reports that this map-detected region occupies $14.76\%$ of the PPT-region area. An illustrative slice at $a=3/10$ has PPT states for approximately $0.1697\leq b\leq0.5303$, with the map detecting those for which $c<0.3$. The analysis establishes a PPT boundary and a sufficient bound-entanglement condition, rather than a complete separability classification. The remaining PPT region, including the threshold line, is described as probably separable, but no separable decomposition or necessity proof is provided. Extensions to higher-dimensional bipartite systems are left for future work.
Central claim may not hold: The abstract’s exact entanglement-partition claim exceeds the proof, which establishes only a sufficient detection condition and leaves the complementary PPT region unclassified. The PPT state with (a,b,c)=(0.3,0.2,0.5) is entangled by subsystem-swap symmetry, contradicting the suggested separability of the undetected region a<c. The potentially negative eigenvalue of the mapped normalized state is (c−a)/3, not c−a, although its sign and the resulting detection threshold are unchanged. The detected fraction of the PPT region is approximately 14.749%, which rounds to 14.75%, rather than the stated “precisely 14.76%.”
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 14 pages, 2 figures, comments welcome