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:2209.15267 · Scientific Reports

Comparing bound entanglement of bell diagonal pairs of qutrits and ququarts

Christopher Popp, Beatrix C. Hiesmayr

Published Feb 4, 2023• 13 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41598-023-29211-w

Related papers

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

Free versus bound entanglement, a NP-hard problem tackled by machine learning

Beatrix C. Hiesmayr

Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.

arXiv:2106.03977•Scientific Reports•Oct 5, 2021•41 citations

Group-theoretic perspective on the positive-partial-transpose and realignment criteria in the magic simplex for bipartite qutrits

Tobias C. Sutter, Christopher Popp, Beatrix C. Hiesmayr

Entanglement is a key feature in many quantum technologies, including secure communication protocols and quantum computing. However, detecting it in mixed quantum states remains a challenging task. While the positive partial transposition (PPT) and computable cross-norm and realignment criteria are well-established tools for entanglement detection in general, and are especially effective in Bell-diagonal states, their connection to the underlying group structure of this state family has not been fully explored. In this work, we analyze the PPT and realignment criteria for Bell-diagonal states from a group-theoretic point of view. Our results demonstrate that the group structure of Bell-diagonal states provides a clear framework for analyzing and computing these two entanglement-detection criteria, thereby highlighting the connection between entanglement and group structure. This unified perspective offers insights into the mathematical and physical properties of entanglement in structured quantum systems and ties the PPT and realignment criteria for Bell-diagonal states to experimental procedures.

arXiv:2508.18393•Physical Review A•Mar 5, 2026•1 citation

Low-rank positive-partial-transpose states and their relation to product vectors

Leif Ove Hansen, Andreas Hauge, Jan Myrheim +1 more

Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.

arXiv:1104.1519•Physical Review A•Feb 6, 2012•15 citations

Two distinct classes of bound entanglement: PPT-bound and `multi-particle'-bound

Beatrix C. Hiesmayr, Marcus Huber

We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons: unlockable due to the multi--particle nature and some states are in addition bound due the fact being positive under partial transposition (PPT). By a general construction (W simplices) we obtain classes of states which have the same geometry concerning separability and entanglement independent of the number of involved particle pairs. Moreover, we introduce a distillation protocol and demonstrate for d=3 that for a certain set of states the entanglement can be increased only up to a certain amount.

arXiv:0906.0238•Jun 1, 2009•5 citations

Geometric Characterization and Feasible Region Analysis of Bipartite Qutrit Bound Entanglement

Mazhar Ali

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.

quant-pharXiv:2609.39141•Oct 1, 2026•1 citation
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.
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.
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.
Entanglement is a key feature in many quantum technologies, including secure communication protocols and quantum computing. However, detecting it in mixed quantum states remains a challenging task. While the positive partial transposition (PPT) and computable cross-norm and realignment criteria are well-established tools for entanglement detection in general, and are especially effective in Bell-diagonal states, their connection to the underlying group structure of this state family has not been fully explored. In this work, we analyze the PPT and realignment criteria for Bell-diagonal states from a group-theoretic point of view. Our results demonstrate that the group structure of Bell-diagonal states provides a clear framework for analyzing and computing these two entanglement-detection criteria, thereby highlighting the connection between entanglement and group structure. This unified perspective offers insights into the mathematical and physical properties of entanglement in structured quantum systems and ties the PPT and realignment criteria for Bell-diagonal states to experimental procedures.
Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.
We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons: unlockable due to the multi--particle nature and some states are in addition bound due the fact being positive under partial transposition (PPT). By a general construction (W simplices) we obtain classes of states which have the same geometry concerning separability and entanglement independent of the number of involved particle pairs. Moreover, we introduce a distillation protocol and demonstrate for d=3 that for a certain set of states the entanglement can be increased only up to a certain amount.
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.