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

The Min-Rains Relative Entropy Is Not Tight for Exact PPT Entanglement Distillation

Chengkai Zhu, Xin Wang

quant-phSubmitted Aug 12, 2026• Announced Aug 13, 2026• 1 citation
arXivHTMLPDF

Abstract

Exact entanglement distillation converts a noisy bipartite state into a maximally entangled state with zero error. Under completely PPT-preserving operations, the additive min-Rains relative entropy provides a single-letter upper bound on the regularized distillation rate. An interesting problem in entanglement theory dating back to 2016 has been whether this bound is always tight. Here we resolve this question in the negative. The key is a tensor-stable rigidity absent from the min-Rains relaxation: every feasible exact-distillation effect must act as the identity on the support of the input state. We convert this constraint into a new single-letter upper bound using a generally non-Hermitian, range-supported witness. For a rank-three subspace, we show this upper bound lies strictly below the min-Rains relative entropy for every state with that support. Thus, the constraint discarded by the min-Rains relaxation remains relevant under arbitrary tensor powers. Our result rules out the min-Rains relative entropy as a closed-form formula for exact PPT distillable entanglement and reveals the subtle asymptotic structure of exact entanglement manipulation under PPT operations.

Comments
15 pages

Related papers

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

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

Single-letter one-way distillable entanglement for non-degradable states

Rabsan Galib Ahmed, Graeme Smith, Peixue Wu

The one-way distillable entanglement is a central operational measure of bipartite entanglement, quantifying the optimal rate at which maximally entangled pairs can be extracted by one-way LOCC. Despite its importance, it is notoriously hard to compute, since it is defined by a regularized optimization over many copies and adaptive one-way protocols. At present, single-letter formulas are only known for (conjugate) degradable and PPT states. More generally, it has remained unclear when one-way distillable entanglement can still be additive beyond degradability and PPT settings, and how such additivity relates to additivity questions of quantum capacity of channels. In this paper, we address this gap by identifying three explicit families of non-degradable and non-PPT states whose one-way distillable entanglement is nevertheless single-letter. First, we introduce two weakened degradability-type conditions--regularized less-noisy and informationally degradable--and prove that each guarantees additivity and hence a single-letter formula. Second, we show a stability result for orthogonally flagged mixtures: when one component has orthogonal support on Alice's system and zero one-way distillable entanglement, the mixture remains single-letter, even though degradability is typically lost under such mixing. Finally, we propose a generalized spin-alignment principle for entropy minimization in tensor-product settings, which we establish in several key cases, including a complete Rényi-2 result. As an application, we obtain additivity results for generalized direct-sum channels and their corresponding Choi states.

quant-pharXiv:2603.23417•Mar 25, 2026•1 citation

Nonadditivity of Rains' bound for distillable entanglement

Xin Wang, Runyao Duan

Rains' bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving positivity of partial transpose (PPT) and was conjectured to be additive and coincide with the asymptotic relative entropy of entanglement. We disprove both conjectures by explicitly constructing a special class of mixed two-qubit states. We then introduce an additive semidefinite programming lower bound (${E}_{M}$) for the asymptotic Rains' bound, and it immediately becomes a computable lower bound for entanglement cost of bipartite states. Furthermore, ${E}_{M}$ is also proved to be the best known upper bound of the PPT-assisted deterministic distillable entanglement and gives the asymptotic rates for all pure states and some class of genuinely mixed states.

arXiv:1605.00348•Physical Review A•Jun 14, 2017•34 citations

PPT Entanglement with Correlated Catalysis: Monotones and Irreversibility

Jingsong Ao, Aby Philip, Alexander Streltsov

Quantum catalysts can overcome otherwise impossible quantum state transformations without being consumed, and allowing them to become correlated with the output makes this assistance substantially more powerful. This raises a fundamental question for entanglement theory: which limitations on state manipulation remain when such correlated catalysts are freely available? We answer this question in the positive-partial-transpose (PPT) resource theory, which allows a substantially broader class of operations than local operations and classical communication (LOCC). We identify general conditions under which regularized relative-entropy measures become strongly superadditive, and use them to construct monotones that constrain correlated catalytic PPT transformations without any knowledge of the catalyst. In particular, we prove that the regularized PPT relative entropy is fully additive and strongly superadditive, resolving an open problem in entanglement theory. Most importantly, these constraints show that even arbitrary correlated catalysts cannot restore asymptotic reversibility: for an explicit state, the optimal entanglement distillation rate remains strictly smaller than the entanglement cost. Thus, substantial catalytic assistance does not remove some of the fundamental limitations of mixed-state entanglement manipulation.

quant-pharXiv:2608.20063•Aug 21, 2026•4 citations

Asymptotic relative entropy of entanglement for orthogonally invariant states

K. Audenaert, Bart De Moor, K. G. H. Vollbrecht +1 more

For a special class of bipartite states we calculate explicitly the asymptotic relative entropy of entanglement ${E}_{R}^{\ensuremath{\infty}}$ with respect to states having a positive partial transpose. This quantity is an upper bound to distillable entanglement. The states considered are invariant under rotations of the form $\mathrm{O}\ensuremath{\bigotimes}\mathrm{O},$ where O is any orthogonal matrix. We show that in this case ${E}_{R}^{\ensuremath{\infty}}$ is equal to another upper bound on distillable entanglement, constructed by Rains. To perform these calculations, we have introduced a number of results that are interesting in their own right: (i) the Rains bound is convex and continuous; (ii) under some weak assumption, the Rains bound is an upper bound to ${E}_{R}^{\ensuremath{\infty}};$ (iii) for states for which the relative entropy of entanglement ${E}_{R}$ is additive, the Rains bound is equal to ${E}_{R}.$

arXiv:quant-ph/0204143•Physical Review A•Sep 18, 2002•95 citations
Exact entanglement distillation converts a noisy bipartite state into a maximally entangled state with zero error. Under completely PPT-preserving operations, the additive min-Rains relative entropy provides a single-letter upper bound on the regularized distillation rate. An interesting problem in entanglement theory dating back to 2016 has been whether this bound is always tight. Here we resolve this question in the negative. The key is a tensor-stable rigidity absent from the min-Rains relaxation: every feasible exact-distillation effect must act as the identity on the support of the input state. We convert this constraint into a new single-letter upper bound using a generally non-Hermitian, range-supported witness. For a rank-three subspace, we show this upper bound lies strictly below the min-Rains relative entropy for every state with that support. Thus, the constraint discarded by the min-Rains relaxation remains relevant under arbitrary tensor powers. Our result rules out the min-Rains relative entropy as a closed-form formula for exact PPT distillable entanglement and reveals the subtle asymptotic structure of exact entanglement manipulation under 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].
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.
The one-way distillable entanglement is a central operational measure of bipartite entanglement, quantifying the optimal rate at which maximally entangled pairs can be extracted by one-way LOCC. Despite its importance, it is notoriously hard to compute, since it is defined by a regularized optimization over many copies and adaptive one-way protocols. At present, single-letter formulas are only known for (conjugate) degradable and PPT states. More generally, it has remained unclear when one-way distillable entanglement can still be additive beyond degradability and PPT settings, and how such additivity relates to additivity questions of quantum capacity of channels. In this paper, we address this gap by identifying three explicit families of non-degradable and non-PPT states whose one-way distillable entanglement is nevertheless single-letter. First, we introduce two weakened degradability-type conditions--regularized less-noisy and informationally degradable--and prove that each guarantees additivity and hence a single-letter formula. Second, we show a stability result for orthogonally flagged mixtures: when one component has orthogonal support on Alice's system and zero one-way distillable entanglement, the mixture remains single-letter, even though degradability is typically lost under such mixing. Finally, we propose a generalized spin-alignment principle for entropy minimization in tensor-product settings, which we establish in several key cases, including a complete Rényi-2 result. As an application, we obtain additivity results for generalized direct-sum channels and their corresponding Choi states.
Rains' bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving positivity of partial transpose (PPT) and was conjectured to be additive and coincide with the asymptotic relative entropy of entanglement. We disprove both conjectures by explicitly constructing a special class of mixed two-qubit states. We then introduce an additive semidefinite programming lower bound (EM{E}_{M}EM​) for the asymptotic Rains' bound, and it immediately becomes a computable lower bound for entanglement cost of bipartite states. Furthermore, EM{E}_{M}EM​ is also proved to be the best known upper bound of the PPT-assisted deterministic distillable entanglement and gives the asymptotic rates for all pure states and some class of genuinely mixed states.
Quantum catalysts can overcome otherwise impossible quantum state transformations without being consumed, and allowing them to become correlated with the output makes this assistance substantially more powerful. This raises a fundamental question for entanglement theory: which limitations on state manipulation remain when such correlated catalysts are freely available? We answer this question in the positive-partial-transpose (PPT) resource theory, which allows a substantially broader class of operations than local operations and classical communication (LOCC). We identify general conditions under which regularized relative-entropy measures become strongly superadditive, and use them to construct monotones that constrain correlated catalytic PPT transformations without any knowledge of the catalyst. In particular, we prove that the regularized PPT relative entropy is fully additive and strongly superadditive, resolving an open problem in entanglement theory. Most importantly, these constraints show that even arbitrary correlated catalysts cannot restore asymptotic reversibility: for an explicit state, the optimal entanglement distillation rate remains strictly smaller than the entanglement cost. Thus, substantial catalytic assistance does not remove some of the fundamental limitations of mixed-state entanglement manipulation.
For a special class of bipartite states we calculate explicitly the asymptotic relative entropy of entanglement ${E}_{R}^{\ensuremath{\infty}}$ with respect to states having a positive partial transpose. This quantity is an upper bound to distillable entanglement. The states considered are invariant under rotations of the form $\mathrm{O}\ensuremath{\bigotimes}\mathrm{O},$ where O is any orthogonal matrix. We show that in this case ${E}_{R}^{\ensuremath{\infty}}$ is equal to another upper bound on distillable entanglement, constructed by Rains. To perform these calculations, we have introduced a number of results that are interesting in their own right: (i) the Rains bound is convex and continuous; (ii) under some weak assumption, the Rains bound is an upper bound to ${E}_{R}^{\ensuremath{\infty}};$ (iii) for states for which the relative entropy of entanglement ER{E}_{R}ER​ is additive, the Rains bound is equal to ER.{E}_{R}.ER​.