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:quant-ph/0503025 · Physical Review A

Publisher's Note: Multiparticle entanglement under asymptotic positive-partial-transpose-preserving operations [Phys. Rev.72, 042325 (2005)]

Satoshi Ishizaka, Martin Bodo Plenio

Published Nov 30, 2005• 2 citations
arXivHTMLPDF

Abstract

We demonstrate that even under positive partial transpose preserving operations in an asymptotic setting GHZ and W states are not reversibly interconvertible. We investigate the structure of minimal reversible entanglement generating set (MREGS) for tri-partite states under positive partial transpose (ppt) preserving operations. We demonstrate that the set consisting of W and EPR states alone cannot be an MREGS. In this context we prove the surprising result that the relative entropy of entanglement can be strictly sub-additive for certain pure tri-partite states which is crucial to keep open the possibility that the set of GHZ-state and EPR states together constitute an MREGS under ppt-preserving operations.

DOI
10.1103/physreva.72.059907

Related papers

Multiparticle entanglement under asymptotic positive-partial-transpose-preserving operations

Satoshi Ishizaka, Martin Bodo Plenio

We demonstrate that even under positive-partial-transpose-preserving operations in an asymptotic setting Greenberger-Horne-Zeilinger (GHZ) and $W$ states are not reversibly interconvertible. We investigate the structure of minimal reversible entanglement generating set (MREGS) for tripartite states under positive-partial-transpose- (PPT-) preserving operations. We demonstrate that the set consisting of $W$ and Einstein-Podolsky-Rosen (EPR) states alone cannot be an MREGS. In this context we prove the surprising result that the relative entropy of entanglement can be strictly subadditive for certain pure tripartite states which is crucial to keep open the possibility that the set of GHZ state and EPR states together constitute an MREGS under PPT-preserving operations.

Physical Review A•Oct 25, 2005•18 citations

Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose

Xin Wang, Runyao Duan

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the 3⊗3 antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As a by-product, we find that for this class of states, both the Rains's bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.

arXiv:1606.09421•Physical Review Letters•Nov 3, 2017•32 citations

Multiparticle entanglement manipulation under positive partial transpose preserving operations

Satoshi Ishizaka, Martin Bodo Plenio

We consider the transformation of multipartite states in the single-copy setting under positive-partial-transpose-preserving operations (PPT operations) and obtain both qualitative and quantitative results. First, for some pure-state transformations that are impossible under local operations and classical communication (LOCC), we demonstrate that they become possible with a surprisingly large success probability under PPT operations. Furthermore, we clarify the convertibility of arbitrary multipartite pure states under PPT operations and show that a drastic simplification in the classification of pure-state entanglement occurs when the set of operations is switched from LOCC to PPT operations. Indeed, the infinitely many types of LOCC-incomparable entanglement are reduced to only one type under the action of PPT operations. This is a clear manifestation of the increased power afforded by the use of PPT-bound entanglement. In addition, we further enlarge the set of operations to clarify the effect of another type of bound entanglement, multipartite unlockable bound entanglement, and show that a further simplification occurs. As compared to pure states a more complicated situation emerges in mixed-state settings. While single-copy distillation becomes possible under PPT operations for some mixed states it remains impossible for other mixed states.

arXiv:quant-ph/0412193•Physical Review A•May 4, 2005•40 citations

A new class of states of reversible entanglement manipulation under positive partial transpose operations

Jing Duan, Yu Luo, Yongming Li

We first study the reversibility for a class of states under the operations which completely preserve the positivity of partial transpose (PPT) and show that the entanglement cost is equal to the distillable entanglement for a rank-two mixed state on the 4⊗4 antisymmetric subspace under PPT operations. By using a similar method in finding the irreversibility, we also find that the value of a new efficiently computable additive lower bound E η ( ρ ) for the asymptotic PPT-relative entropy of entanglement presented in [ Phys. Rev. Lett. 119 , 180506 (2017)] is equal to the regularized Rains’ bound and an upper bound E N ( ρ ) for distillable entanglement for these states. Furthermore, we find states on the symmetric subspace satisfying the relation mentioned above, generalize the antisymmetric states and symmetric states in higher dimensions, and give a specific value for distillable entanglement and entanglement cost for these states under the PPT operations.

Chinese Physics B•Nov 1, 2018•1 citation

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

Asymptotic Indistinguishability of Bipartite Quantum States by Operations Completely Preserving Positivity of Partial Transpose

Yinan Li, Xin Wang, Runyao Duan

A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer $k$, there is no PPT state supporting on the orthogonal complement of $S^{\otimes k}$. We show that a subspace is strongly PPT-unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Applying this result, we demonstrate a simple criterion for verifying whether a set of bipartite quantum states is asymptotically indistinguishable by operations completely preserving positivity of partial transpose. This criterion is based on the observation that if the support of some bipartite state is strongly PPT-unextendible, then any set of bipartite quantum states which contains this state cannot be asymptotically distinguished by PPT operations. Utilizing this criterion, we further show that any entangled pure state and its orthogonal complement cannot be distinguished asymptotically by PPT operations. Meanwhile, we also investigate that the minimum dimension of strongly PPT-unextendible subspaces in a $m\otimes n$ system is $m+n-1$, which involves an extension of the result that non-positive-partial-transpose (NPT) subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87: 064302 (2013)].

•Feb 1, 2017•1 citation
We demonstrate that even under positive partial transpose preserving operations in an asymptotic setting GHZ and W states are not reversibly interconvertible. We investigate the structure of minimal reversible entanglement generating set (MREGS) for tri-partite states under positive partial transpose (ppt) preserving operations. We demonstrate that the set consisting of W and EPR states alone cannot be an MREGS. In this context we prove the surprising result that the relative entropy of entanglement can be strictly sub-additive for certain pure tri-partite states which is crucial to keep open the possibility that the set of GHZ-state and EPR states together constitute an MREGS under ppt-preserving operations.
We demonstrate that even under positive-partial-transpose-preserving operations in an asymptotic setting Greenberger-Horne-Zeilinger (GHZ) and WWW states are not reversibly interconvertible. We investigate the structure of minimal reversible entanglement generating set (MREGS) for tripartite states under positive-partial-transpose- (PPT-) preserving operations. We demonstrate that the set consisting of WWW and Einstein-Podolsky-Rosen (EPR) states alone cannot be an MREGS. In this context we prove the surprising result that the relative entropy of entanglement can be strictly subadditive for certain pure tripartite states which is crucial to keep open the possibility that the set of GHZ state and EPR states together constitute an MREGS under PPT-preserving operations.
We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the 3⊗3 antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As a by-product, we find that for this class of states, both the Rains's bound and its regularization are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.
We consider the transformation of multipartite states in the single-copy setting under positive-partial-transpose-preserving operations (PPT operations) and obtain both qualitative and quantitative results. First, for some pure-state transformations that are impossible under local operations and classical communication (LOCC), we demonstrate that they become possible with a surprisingly large success probability under PPT operations. Furthermore, we clarify the convertibility of arbitrary multipartite pure states under PPT operations and show that a drastic simplification in the classification of pure-state entanglement occurs when the set of operations is switched from LOCC to PPT operations. Indeed, the infinitely many types of LOCC-incomparable entanglement are reduced to only one type under the action of PPT operations. This is a clear manifestation of the increased power afforded by the use of PPT-bound entanglement. In addition, we further enlarge the set of operations to clarify the effect of another type of bound entanglement, multipartite unlockable bound entanglement, and show that a further simplification occurs. As compared to pure states a more complicated situation emerges in mixed-state settings. While single-copy distillation becomes possible under PPT operations for some mixed states it remains impossible for other mixed states.
We first study the reversibility for a class of states under the operations which completely preserve the positivity of partial transpose (PPT) and show that the entanglement cost is equal to the distillable entanglement for a rank-two mixed state on the 4⊗4 antisymmetric subspace under PPT operations. By using a similar method in finding the irreversibility, we also find that the value of a new efficiently computable additive lower bound E η ( ρ ) for the asymptotic PPT-relative entropy of entanglement presented in [ Phys. Rev. Lett. 119 , 180506 (2017)] is equal to the regularized Rains’ bound and an upper bound E N ( ρ ) for distillable entanglement for these states. Furthermore, we find states on the symmetric subspace satisfying the relation mentioned above, generalize the antisymmetric states and symmetric states in higher dimensions, and give a specific value for distillable entanglement and entanglement cost for these states under the PPT operations.
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].
A bipartite subspace SSS is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer kkk, there is no PPT state supporting on the orthogonal complement of S⊗kS^{\otimes k}S⊗k. We show that a subspace is strongly PPT-unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Applying this result, we demonstrate a simple criterion for verifying whether a set of bipartite quantum states is asymptotically indistinguishable by operations completely preserving positivity of partial transpose. This criterion is based on the observation that if the support of some bipartite state is strongly PPT-unextendible, then any set of bipartite quantum states which contains this state cannot be asymptotically distinguished by PPT operations. Utilizing this criterion, we further show that any entangled pure state and its orthogonal complement cannot be distinguished asymptotically by PPT operations. Meanwhile, we also investigate that the minimum dimension of strongly PPT-unextendible subspaces in a m⊗nm\otimes nm⊗n system is m+n−1m+n-1m+n−1, which involves an extension of the result that non-positive-partial-transpose (NPT) subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87: 064302 (2013)].