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:1708.03885

The Minimum Distance of PPT Bound Entangled States from the Maximally Mixed State

Shreya Banerjee, Aryaman A. Patel, Prasanta Kumar Panigrahi

Published Aug 13, 2017• 0 citations
arXivHTMLPDF

Abstract

Using a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices, we obtain the minimum distance between a bipartite bound entangled $n$- qudit density matrix and the maximally mixed state.This minimum distance for which entangled density matrices necessarily have positive partial transpose (PPT) is obtained as $\frac{1}{\sqrt{\sqrt{d^n(d^n-1)}+1}}$, which is also a lower limit for the existence of 1-distillable entangled states. The separable states necessarily lie within a minimum distance of $\frac{R}{1+d^{n-1}}$ from the Identity,where R is the radius of the closed ball homeomorphic to the set of density matrices, which is lesser than the limit for the limit for PPT bound entangled states. Furthermore an alternate proof on the non-emptiness of the PPT bound entangled states has also been given.

DOI
10.48550/arxiv.1708.03885

Related papers

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•16 citations

The distillability of entanglement of bipartite reduced density matrices of a tripartite state

Yize Sun, Lin Chen

Abstract The relation between the distillability of entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in Hayashi and Chen [2011 Phys. Rev. A 84 012325]. We extend this result to the tripartite mixed state of rank at most three. In particular we show that if the state has two bipartite reduced density operators with rank two, then the third bipartite reduced density operator additionally having non positive partial transpose (non-PPT) is distillable. In contrast, we show that the tripartite PPT state with two reduced density operators of rank two is a three-qubit fully separable state. We obtain these facts by proving a conjectured matrix inequality for the bipartite matrix M with Schmidt rank at most three. This is one of the main results of this paper. We also prove it for some M with arbitrary Schmidt rank.

Journal of Physics A Mathematical and Theoretical•Jun 1, 2020•4 citations

Bound entangled states with extremal properties

Piotr Badzia ̧g, Karol Horodecki, Michał Horodecki +2 more

Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least $1/4$. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.

arXiv:1309.7992•Physical Review A•Jul 2, 2014•10 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

On PPT entanglement distillation

Ludovico Lami

We study entanglement distillation under operations that remain completely positive under partial-transpose conjugation, a.k.a. PPT channels, in the standard quantum Shannon theory regime of asymptotically vanishing but non-zero error. Our main results are: (a) a regularised formula for the PPT distillable entanglement in terms of a measured-relative-entropy-like quantity; and (b) two different single-letter converses, one based on operator quadratic forms and the other on Hirschman's strengthening of the Hadamard three-line theorem. As an immediate application of (b), we show that the PPT distillable entanglement can be strictly smaller than the regularised Rains bound, thereby resolving an open problem in the theory of entanglement manipulation [Regula et al., NJP 21:103017, 2019]. A gap appears already for $3\times 3$ Werner states: at antisymmetric weight $25/26$, a certified upper bound of $0.62107$ ebits lies below the (regularised) Rains bound, which equals $\frac{25}{26} \log_2 5 - \log_2 3 \approx 0.64766$ ebits. On a different note, (a) implies a faithful lower bound on the PPT distillable entanglement in terms of the entanglement negativity, which provides a quantitative counterpart to the qualitatively known fact that any NPT state is PPT distillable [Eggeling et al., PRL 87:257902, 2001].

quant-pharXiv:2610.12454•Oct 9, 2026•0 citations

Spectral criteria for absolute positive partial transpose (PPT) in qudit-qudit state systems

Liang Xiong, Nung-Sing Sze

Separability from the spectrum is an important and ongoing research topic in quantum entanglement. In this study, we investigate properties related to absolute separability from the spectrum in qudit-qudit states in the bipartite state space Hmn=Hm⊗Hn. First, we propose the necessary and sufficient conditions for absolute positive partial transpose states in the Hilbert space H4n. These conditions are equivalent to the positive semidefiniteness of twelve matrices resulting from the symmetric matricizations of eigenvalues. Furthermore, we demonstrate that these sufficient conditions can be extended to the general Hmn case, improving existing conclusions in the literature. These sufficient conditions depend only on the first few leading and last few leading eigenvalues, significantly reducing the complexity of determining absolute separable states. On the other hand, we also introduce additional sufficient conditions for determining that states in Hmn are not absolutely separable. These conditions only depend on 2m − 1 eigenvalues of the mixed states. Our sufficient conditions are not only simple and easy to implement, but also effective in practice. As applications, we derive distance bounds for eigenvalues and purity bounds for general absolutely separable states.

Journal of Mathematical Physics•Jan 1, 2026•0 citations
Using a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices, we obtain the minimum distance between a bipartite bound entangled nnn- qudit density matrix and the maximally mixed state.This minimum distance for which entangled density matrices necessarily have positive partial transpose (PPT) is obtained as 1dn(dn−1)+1\frac{1}{\sqrt{\sqrt{d^n(d^n-1)}+1}}dn(dn−1)​+1​1​, which is also a lower limit for the existence of 1-distillable entangled states. The separable states necessarily lie within a minimum distance of R1+dn−1\frac{R}{1+d^{n-1}}1+dn−1R​ from the Identity,where R is the radius of the closed ball homeomorphic to the set of density matrices, which is lesser than the limit for the limit for PPT bound entangled states. Furthermore an alternate proof on the non-emptiness of the PPT bound entangled states has also been given.
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.
Abstract The relation between the distillability of entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in Hayashi and Chen [2011 Phys. Rev. A 84 012325]. We extend this result to the tripartite mixed state of rank at most three. In particular we show that if the state has two bipartite reduced density operators with rank two, then the third bipartite reduced density operator additionally having non positive partial transpose (non-PPT) is distillable. In contrast, we show that the tripartite PPT state with two reduced density operators of rank two is a three-qubit fully separable state. We obtain these facts by proving a conjectured matrix inequality for the bipartite matrix M with Schmidt rank at most three. This is one of the main results of this paper. We also prove it for some M with arbitrary Schmidt rank.
Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least 1/41/41/4. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.
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 entanglement distillation under operations that remain completely positive under partial-transpose conjugation, a.k.a. PPT channels, in the standard quantum Shannon theory regime of asymptotically vanishing but non-zero error. Our main results are: (a) a regularised formula for the PPT distillable entanglement in terms of a measured-relative-entropy-like quantity; and (b) two different single-letter converses, one based on operator quadratic forms and the other on Hirschman's strengthening of the Hadamard three-line theorem. As an immediate application of (b), we show that the PPT distillable entanglement can be strictly smaller than the regularised Rains bound, thereby resolving an open problem in the theory of entanglement manipulation [Regula et al., NJP 21:103017, 2019]. A gap appears already for 3×33\times 33×3 Werner states: at antisymmetric weight 25/2625/2625/26, a certified upper bound of 0.621070.621070.62107 ebits lies below the (regularised) Rains bound, which equals 2526log⁡25−log⁡23≈0.64766\frac{25}{26} \log_2 5 - \log_2 3 \approx 0.647662625​log2​5−log2​3≈0.64766 ebits. On a different note, (a) implies a faithful lower bound on the PPT distillable entanglement in terms of the entanglement negativity, which provides a quantitative counterpart to the qualitatively known fact that any NPT state is PPT distillable [Eggeling et al., PRL 87:257902, 2001].
Separability from the spectrum is an important and ongoing research topic in quantum entanglement. In this study, we investigate properties related to absolute separability from the spectrum in qudit-qudit states in the bipartite state space Hmn=Hm⊗Hn. First, we propose the necessary and sufficient conditions for absolute positive partial transpose states in the Hilbert space H4n. These conditions are equivalent to the positive semidefiniteness of twelve matrices resulting from the symmetric matricizations of eigenvalues. Furthermore, we demonstrate that these sufficient conditions can be extended to the general Hmn case, improving existing conclusions in the literature. These sufficient conditions depend only on the first few leading and last few leading eigenvalues, significantly reducing the complexity of determining absolute separable states. On the other hand, we also introduce additional sufficient conditions for determining that states in Hmn are not absolutely separable. These conditions only depend on 2m − 1 eigenvalues of the mixed states. Our sufficient conditions are not only simple and easy to implement, but also effective in practice. As applications, we derive distance bounds for eigenvalues and purity bounds for general absolutely separable states.