Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.39141

Geometric Characterization and Feasible Region Analysis of Bipartite Qutrit Bound Entanglement

Mazhar Ali

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

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.

Comments
14 pages, 2 figures, comments welcome

Related papers

Sparse anisotropic positive maps for qutrit entanglement: exact indecomposability and PPT geometry

Massimiliano F. Sacchi

Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters $w$ and $z$. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square $0\le w,z\le2/3$, complete positivity on the smaller square $0\le w,z\le1/3$, and decomposability is lost precisely outside a quarter circle in the corner $w,z\ge1/3$. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint $W_*=W(2/3,2/3)$ we construct a four-parameter family of PPT edge states of rank type $(5,5)$, derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although $W_*$ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.

quant-pharXiv:2607.12470•Physical Review A•Jul 15, 2026•0 citations

Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits

Christopher Popp, Beatrix C. Hiesmayr

With a probability of success of 95% we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be separable, free entangled or bound entangled. Leveraging a geometrical representation of these states in Euclidean space, novel methods are presented that allow the classification of separable and bound entangled Bell diagonal states in an efficient way. Moreover, the classification allows the precise determination of relative volumes of the classes of separable, free and bound entangled states. In detail, out of all Bell diagonal PPT states [Formula: see text] are determined to be separable while [Formula: see text] are bound entangled and only [Formula: see text] remain unclassified. Moreover, our applied criteria are compared for their effectiveness and relation as detectors of bound entanglement, which reveals that not a single criterion is capable to detect all bound entangled states.

arXiv:2205.11405•Scientific Reports•Jul 21, 2022•14 citations

Geometry and Entanglement of Two-Qubit States in the Quantum Probabilistic Representation

Julio A. López-Saldívar, Octavio Castaños, Eduardo Nahmad-Achar +3 more

A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres-Horodecki positive partial transpose (ppt) -criterion and the concurrence inequalities are formulated as the conditions that the introduced probability distributions must satisfy to present entanglement. A four-level system, where one or two states are inaccessible, is considered as an example of applying the elaborated probability approach in an explicit form. The areas of three Triadas of Malevich's squares for entangled states of two qubits are defined through the qutrit state, and the critical values of the sum of their areas are calculated. We always find an interval for the sum of the square areas, which provides the possibility for an experimental checkup of the entanglement of the system in terms of the probabilities.

arXiv:1808.08194•Entropy•Aug 24, 2018•33 citations

Comparing bound entanglement of bell diagonal pairs of qutrits and ququarts

Christopher Popp, Beatrix C. Hiesmayr

We compare the classification as entangled or separable of Bell diagonal bipartite qudits with positive partial transposition (PPT) and their properties for different dimensions. For dimension [Formula: see text], a form of entanglement exists that is hard to detect and called bound entanglement due to the fact that such entangled states cannot be used for entanglement distillation. Up to this date, no efficient solution is known to differentiate bound entangled from separable states. We address and compare this problem named separability problem for a family of bipartite Bell diagonal qudits with special algebraic and geometric structures and applications in quantum information processing tasks in different dimensions. Extending analytical and numerical methods and results for Bell diagonal qutrits ([Formula: see text]), we successfully classify more than [Formula: see text] of representative Bell diagonal PPT states for [Formula: see text]. Via those representative states we are able to estimate the volumes of separable and bound entangled states among PPT ququarts ([Formula: see text]). We find that at least [Formula: see text] of all PPT states are separable, [Formula: see text] bound entangled and for [Formula: see text] it remains unclear whether they are separable or bound entangled. Comparing the structure of bound entangled states and their detectors, we find considerable differences in the detection capabilities for different dimensions and relate those to differences of the Euclidean geometry for qutrits ([Formula: see text]) and ququarts ([Formula: see text]). Finally, using a detailed visual analysis of the set of separable and bound entangled Bell diagonal states in both dimensions, qualitative observations are made that allow to better distinguish bound entangled from separable states.

arXiv:2209.15267•Scientific Reports•Feb 4, 2023•12 citations

Sparse positive maps on qutrits with exact nondecomposability thresholds and PPT-entanglement transitions

Davide Poderini, Angela Rosy Morgillo, Fabio Benatti +3 more

We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.

quant-pharXiv:2606.19765•Quantum Science and Technology•Jun 19, 2026•0 citations

New family of bound entangled states residing on the boundary of Peres set

Saronath Halder, Manik Banik, Sibasish Ghosh A

Bound entangled (BE) states are strange in nature: non-zero amount of free entanglement is required to create them but no free entanglement can be distilled from them under local operations and classical communication (LOCC). Even though usefulness of such states has been shown in several information processing tasks, there exists no simple method to characterize all these states for an arbitrary composite quantum system. Here we present a $(d-3)/2$-parameter family of BE states each with positive partial transpose (PPT). This family of PPT-BE states is introduced by constructing an unextendible product basis (UPB) in $\mathbb{C}^d\otimes\mathbb{C}^d$ with $d$ odd and $d\ge 5$. We also provide the `tile structure' corresponding to these UPBs. The range of each such PPT-BE state is contained in a $2(d-1)$ dimensional entangled subspace whereas the associated UPB-subspace is of dimension $(d-1)^2+1$. We further show that each of these PPT-BE states can be written as a convex combination of $(d-1)/2$ number of rank-4 PPT-BE states. Moreover, we prove that these rank-4 PPT-BE states are extreme points of the convex compact set $\mathcal{P}$ of all PPT states in $\mathbb{C}^d\otimes\mathbb{C}^d$, namely the {\it Peres} set. An interesting geometric implication of our result is that the convex hull of these rank-4 PPT-BE extreme points -- the $(d-3)/2$-simplex -- is sitting on the boundary between the set $\mathcal{P}$ and the set of non-PPT states. We also discuss consequences of our construction in the context of quantum state discrimination by LOCC.

•Jan 1, 2018•4 citations
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ρ_{a,b,c}ρ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 (a2+ab+b2−b≤0)(a^2+ab+b^2-b \leq 0)(a2+ab+b2−b≤0) over the domain 0<a≤130 < a \leq \frac{1}{3}0<a≤31​, and identify the exact linear threshold (a>c)(a > c)(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%14.76\%14.76% of the total PPT leaf area.
Positive but not completely positive maps provide one of the most direct ways to detect entanglement beyond the positive-partial-transpose (PPT) criterion. We introduce and analyze an exactly solvable two-parameter family of sparse bistochastic positive maps on qutrits, in which two coherence channels are independently tuned by parameters www and zzz. The sparse structure makes the full phase diagram analytic: positivity holds exactly on the square 0≤w,z≤2/30\le w,z\le2/30≤w,z≤2/3, complete positivity on the smaller square 0≤w,z≤1/30\le w,z\le1/30≤w,z≤1/3, and decomposability is lost precisely outside a quarter circle in the corner w,z≥1/3w,z\ge1/3w,z≥1/3. The indecomposable region is certified by explicit PPT entangled state adapted to the same witness geometry. At the endpoint W∗=W(2/3,2/3)W_*=W(2/3,2/3)W∗​=W(2/3,2/3) we construct a four-parameter family of PPT edge states of rank type (5,5)(5,5)(5,5), derive their analytic detection region, and show that the corresponding rays are exposed faces of the PPT cone. Finally, although W∗W_*W∗​ is not optimal, we give an explicit optimal refinement whose detection region on this family is strictly larger. The result is an analytically tractable qutrit setting in which positivity, indecomposability, PPT entanglement, optimality, and exposed convex geometry can be studied in a single framework.
With a probability of success of 95% we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be separable, free entangled or bound entangled. Leveraging a geometrical representation of these states in Euclidean space, novel methods are presented that allow the classification of separable and bound entangled Bell diagonal states in an efficient way. Moreover, the classification allows the precise determination of relative volumes of the classes of separable, free and bound entangled states. In detail, out of all Bell diagonal PPT states [Formula: see text] are determined to be separable while [Formula: see text] are bound entangled and only [Formula: see text] remain unclassified. Moreover, our applied criteria are compared for their effectiveness and relation as detectors of bound entanglement, which reveals that not a single criterion is capable to detect all bound entangled states.
A new geometric representation of qubit and qutrit states based on probability simplexes is used to describe the separability and entanglement properties of density matrices of two qubits. The Peres-Horodecki positive partial transpose (ppt) -criterion and the concurrence inequalities are formulated as the conditions that the introduced probability distributions must satisfy to present entanglement. A four-level system, where one or two states are inaccessible, is considered as an example of applying the elaborated probability approach in an explicit form. The areas of three Triadas of Malevich's squares for entangled states of two qubits are defined through the qutrit state, and the critical values of the sum of their areas are calculated. We always find an interval for the sum of the square areas, which provides the possibility for an experimental checkup of the entanglement of the system in terms of the probabilities.
We compare the classification as entangled or separable of Bell diagonal bipartite qudits with positive partial transposition (PPT) and their properties for different dimensions. For dimension [Formula: see text], a form of entanglement exists that is hard to detect and called bound entanglement due to the fact that such entangled states cannot be used for entanglement distillation. Up to this date, no efficient solution is known to differentiate bound entangled from separable states. We address and compare this problem named separability problem for a family of bipartite Bell diagonal qudits with special algebraic and geometric structures and applications in quantum information processing tasks in different dimensions. Extending analytical and numerical methods and results for Bell diagonal qutrits ([Formula: see text]), we successfully classify more than [Formula: see text] of representative Bell diagonal PPT states for [Formula: see text]. Via those representative states we are able to estimate the volumes of separable and bound entangled states among PPT ququarts ([Formula: see text]). We find that at least [Formula: see text] of all PPT states are separable, [Formula: see text] bound entangled and for [Formula: see text] it remains unclear whether they are separable or bound entangled. Comparing the structure of bound entangled states and their detectors, we find considerable differences in the detection capabilities for different dimensions and relate those to differences of the Euclidean geometry for qutrits ([Formula: see text]) and ququarts ([Formula: see text]). Finally, using a detailed visual analysis of the set of separable and bound entangled Bell diagonal states in both dimensions, qualitative observations are made that allow to better distinguish bound entangled from separable states.
We study a family of sparse positive maps on qutrits for which positivity, decomposability, and PPT entanglement can all be analysed explicitly. The block structure of the associated Choi matrices reduces positivity to a Hermitian biquadratic form and leads to exact positivity boundaries for three representative parametric families. For the same families we determine the exact transition between decomposable and non-decomposable maps and construct associated PPT states of two classes. The first consists of witness-adapted deformations naturally tied to the non-decomposability analysis. The second consists of analytically tractable families whose full PPT-entangled branch is detected by fixed positive maps, yielding exact thresholds between separability and bound entanglement. For the trace-preserving subclass, we further compare positivity with a recent eigenvalue bound for 2-positive maps, thereby making the gap between positivity and higher-order positivity fully explicit within this family.
Bound entangled (BE) states are strange in nature: non-zero amount of free entanglement is required to create them but no free entanglement can be distilled from them under local operations and classical communication (LOCC). Even though usefulness of such states has been shown in several information processing tasks, there exists no simple method to characterize all these states for an arbitrary composite quantum system. Here we present a (d−3)/2(d-3)/2(d−3)/2-parameter family of BE states each with positive partial transpose (PPT). This family of PPT-BE states is introduced by constructing an unextendible product basis (UPB) in Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd with ddd odd and d≥5d\ge 5d≥5. We also provide the `tile structure' corresponding to these UPBs. The range of each such PPT-BE state is contained in a 2(d−1)2(d-1)2(d−1) dimensional entangled subspace whereas the associated UPB-subspace is of dimension (d−1)2+1(d-1)^2+1(d−1)2+1. We further show that each of these PPT-BE states can be written as a convex combination of (d−1)/2(d-1)/2(d−1)/2 number of rank-4 PPT-BE states. Moreover, we prove that these rank-4 PPT-BE states are extreme points of the convex compact set P\mathcal{P}P of all PPT states in Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd, namely the {\it Peres} set. An interesting geometric implication of our result is that the convex hull of these rank-4 PPT-BE extreme points -- the (d−3)/2(d-3)/2(d−3)/2-simplex -- is sitting on the boundary between the set P\mathcal{P}P and the set of non-PPT states. We also discuss consequences of our construction in the context of quantum state discrimination by LOCC.