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

On PPT entanglement distillation

Ludovico Lami

quant-phSubmitted Oct 8, 2026• Announced Oct 9, 2026• 0 citations
arXivHTMLPDF

Abstract

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].

AI Summary

The paper studies entanglement distillation under completely PPT-preserving channels in the asymptotic, vanishing-error regime. Its central question is whether PPT distillable entanglement equals the regularised Rains bound. It establishes $E_{d,\mathrm{PPT}}(\rho)=L^\infty(\rho)$, where $L(\rho)=\sup_{(E_j)}\sum_j p_j\log_2[p_j/\|E_j^\Gamma\|_\infty]$ and $p_j=\operatorname{Tr}(\rho E_j)$. Achievability uses repeated measurements and classical typicality; the reverse inequality pulls back the Bell test of a distillation protocol. An auxiliary measurement functional yields the faithful lower bound $E_{d,\mathrm{PPT}}(\rho)\geq1-h_2(1/2+N(\rho)/(d+1))$, with $d=\min(d_A,d_B)$, quantitatively strengthening the known distillability of every NPT state under PPT operations. Two converse constructions use quadratic forms on operator spaces and analytic matrix families with Hirschman’s three-line inequality, respectively. Both provide exponential strong converses and also bound LOCC distillation. For the two-qutrit Werner state with antisymmetric weight $25/26$, they establish $0.5836\leq E_{d,\mathrm{PPT}}\leq0.62107$, strictly below $R^\infty=(25/26)\log_2 5-\log_2 3\approx0.64766$. Thus equality with the regularised Rains bound fails. The lower certificate uses a feasible 48-copy POVM; the quadratic separation reduces to a two-dimensional calculation, while the tighter analytic bound uses directed-rounding quadrature. The characterisation remains regularised, with no convergence-rate guarantee. The quadratic framework requires an all-copy constraint that does not follow from one-copy validity. The numerical certificates do not establish optimal rates or optimal converse parameters. A single-letter formula, general computability, and a complete convergent family of upper bounds remain open.

Almost certainly largely AI-generatedAI use disclosed
The main results and techniques presented here have been derived almost entirely by ChatGPT Astra.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
31+7 pages, 1 figure

Related papers

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

Chengkai Zhu, Xin Wang

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.

quant-pharXiv:2608.12135•Aug 13, 2026•1 citation

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

Improved semidefinite programming upper bound on distillable entanglement

Xin Wang, Runyao Duan

An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT). This quantity is always smaller than or equal to the logarithmic negativity, the previously best known SDP bound on distillable entanglement, and the inequality is strict in general. Furthermore, a succinct SDP characterization of the one-copy PPT deterministic distillable entanglement for any given state is also obtained, which provides a simple but useful lower bound on the PPT distillable entanglement. Remarkably, there is a genuinely mixed state of which both bounds coincide with the distillable entanglement, while being strictly less than the logarithmic negativity.

arXiv:1601.07940•Physical Review A•Nov 28, 2016•50 citations

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

Very Strong Irreversibility of Quantum Entanglement

Tulja Varun Kondra, Raphael Brinster, Hermann Kampermann +2 more

The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.

quant-pharXiv:2607.27195•Jul 30, 2026•0 citations

Entanglement Cost under Positive-Partial-Transpose-Preserving Operations

K. Audenaert, Martin Bodo Plenio, Jens Eisert

We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational interpretation for this entanglement measure. As examples we discuss general Werner states and arbitrary bipartite Gaussian states. Then we prove that for the antisymmetric Werner state PPT cost and PPT entanglement of distillation coincide. This is the first example of a truly mixed state for which entanglement manipulation is asymptotically reversible, which points towards a unique entanglement measure under PPT operations.

arXiv:quant-ph/0207146•Physical Review Letters•Jan 16, 2003•288 citations
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].
The paper studies entanglement distillation under completely PPT-preserving channels in the asymptotic, vanishing-error regime. Its central question is whether PPT distillable entanglement equals the regularised Rains bound.
It establishes Ed,PPT(ρ)=L∞(ρ)E_{d,\mathrm{PPT}}(\rho)=L^\infty(\rho)Ed,PPT​(ρ)=L∞(ρ), where L(ρ)=sup⁡(Ej)∑jpjlog⁡2[pj/∥EjΓ∥∞]L(\rho)=\sup_{(E_j)}\sum_j p_j\log_2[p_j/\|E_j^\Gamma\|_\infty]L(ρ)=sup(Ej​)​∑j​pj​log2​[pj​/∥EjΓ​∥∞​] and pj=Tr⁡(ρEj)p_j=\operatorname{Tr}(\rho E_j)pj​=Tr(ρEj​). Achievability uses repeated measurements and classical typicality; the reverse inequality pulls back the Bell test of a distillation protocol. An auxiliary measurement functional yields the faithful lower bound Ed,PPT(ρ)≥1−h2(1/2+N(ρ)/(d+1))E_{d,\mathrm{PPT}}(\rho)\geq1-h_2(1/2+N(\rho)/(d+1))Ed,PPT​(ρ)≥1−h2​(1/2+N(ρ)/(d+1)), with d=min⁡(dA,dB)d=\min(d_A,d_B)d=min(dA​,dB​), quantitatively strengthening the known distillability of every NPT state under PPT operations.
Two converse constructions use quadratic forms on operator spaces and analytic matrix families with Hirschman’s three-line inequality, respectively. Both provide exponential strong converses and also bound LOCC distillation. For the two-qutrit Werner state with antisymmetric weight 25/2625/2625/26, they establish 0.5836≤Ed,PPT≤0.621070.5836\leq E_{d,\mathrm{PPT}}\leq0.621070.5836≤Ed,PPT​≤0.62107, strictly below R∞=(25/26)log⁡25−log⁡23≈0.64766R^\infty=(25/26)\log_2 5-\log_2 3\approx0.64766R∞=(25/26)log2​5−log2​3≈0.64766. Thus equality with the regularised Rains bound fails. The lower certificate uses a feasible 48-copy POVM; the quadratic separation reduces to a two-dimensional calculation, while the tighter analytic bound uses directed-rounding quadrature.
The characterisation remains regularised, with no convergence-rate guarantee. The quadratic framework requires an all-copy constraint that does not follow from one-copy validity. The numerical certificates do not establish optimal rates or optimal converse parameters. A single-letter formula, general computability, and a complete convergent family of upper bounds remain open.
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 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.
An additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT). This quantity is always smaller than or equal to the logarithmic negativity, the previously best known SDP bound on distillable entanglement, and the inequality is strict in general. Furthermore, a succinct SDP characterization of the one-copy PPT deterministic distillable entanglement for any given state is also obtained, which provides a simple but useful lower bound on the PPT distillable entanglement. Remarkably, there is a genuinely mixed state of which both bounds coincide with the distillable entanglement, while being strictly less than the logarithmic negativity.
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.
The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.
We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational interpretation for this entanglement measure. As examples we discuss general Werner states and arbitrary bipartite Gaussian states. Then we prove that for the antisymmetric Werner state PPT cost and PPT entanglement of distillation coincide. This is the first example of a truly mixed state for which entanglement manipulation is asymptotically reversible, which points towards a unique entanglement measure under PPT operations.