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

PPT Entanglement with Correlated Catalysis: Monotones and Irreversibility

Jingsong Ao, Aby Philip, Alexander Streltsov

quant-phSubmitted Aug 20, 2026• Announced Aug 21, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

Comments
6+7 pages, no figures

Related papers

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

Equivalence of Correlated Catalytic and Marginal Asymptotic Transformations in Quantum Resource Theories

Jingsong Ao, Aby Philip, Alexander Streltsov

We prove that correlated-catalytic state conversion is possible if and only if the marginal asymptotic conversion rate is at least one. Under general operational assumptions, this equivalence holds for arbitrary states in broad classes of entanglement, coherence, and magic theories. It reduces the characterization of correlated-catalytic convertibility to the computation of marginal asymptotic rates, and yields transitivity and equality of catalytic and marginal conversion rates. Under local operations and classical communication, we fully characterize correlated-catalytic conversion from arbitrary bipartite states to entangled pure states in terms of distillable entanglement. We show that correlated catalysts cannot increase the distillable entanglement or distillable secret key of any bipartite state, and in particular cannot make bound entanglement distillable. Extending our construction to adaptive communication protocols, we further prove that correlated catalysts cannot enhance the two-way private-state generation capacity of any finite-dimensional quantum channel.

arXiv:2611.06573•Nov 4, 2026•0 citations

Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose

William Matthews, Andreas Winter

Motivated by the desire to better understand the class of quantum operations on bipartite systems that completely preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure-state transformations by PPT operations. Restricting our attention to the case in which we start with a rank $\mathit{K}$ maximally entangled state, we give a necessary condition for transforming it into a given pure state, which we show is also sufficient when $\mathit{K}$ is 2 and the final state has Schmidt rank 3. We show that it is sufficient for all $\mathit{K}$ and all final states provided a conjecture about a certain family of semidefinite programs is true. We also demonstrate that the phenomenon of catalysis can occur under PPT operations and that, unlike LOCC catalysis, a maximally entangled state can be a catalyst. Finally, we give a necessary and sufficient condition for the possibility of transforming a rank $\mathit{K}$ maximally entangled state to an arbitrary pure state by PPT operations assisted by some maximally entangled catalyst.

arXiv:0801.4322•Physical Review A•Jul 10, 2008•21 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

Catalytic and Asymptotic Equivalence for Quantum Entanglement

Ray Ganardi, Tulja Varun Kondra, Alexander Streltsov

Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often challenging due to the presence of noise. Typically, entanglement manipulation procedures involving asymptotically many copies of a state are considered to overcome this problem. These procedures allow for distilling highly entangled pure states from noisy states, which enables a wide range of applications, such as quantum teleportation and quantum cryptography. When it comes to manipulating entangled quantum systems on a single copy level, using entangled states as catalysts can significantly broaden the range of achievable transformations. Similar to the concept of catalysis in chemistry, the entangled catalyst is returned unchanged at the end of the state manipulation procedure. Our results demonstrate that despite the apparent conceptual differences between the asymptotic and catalytic settings, they are actually strongly connected and fully equivalent for all distillable states. Our methods rely on the analysis of many-copy entanglement manipulation procedures which may establish correlations between different copies. As an important consequence, we demonstrate that using an entangled catalyst cannot enhance the asymptotic singlet distillation rate of a distillable quantum state. Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and asymptotic state transformations of entangled states, and highlight the importance of correlations in these processes.

arXiv:2305.03488•Physical Review Letters•Dec 19, 2024•20 citations

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
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.
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 prove that correlated-catalytic state conversion is possible if and only if the marginal asymptotic conversion rate is at least one. Under general operational assumptions, this equivalence holds for arbitrary states in broad classes of entanglement, coherence, and magic theories. It reduces the characterization of correlated-catalytic convertibility to the computation of marginal asymptotic rates, and yields transitivity and equality of catalytic and marginal conversion rates. Under local operations and classical communication, we fully characterize correlated-catalytic conversion from arbitrary bipartite states to entangled pure states in terms of distillable entanglement. We show that correlated catalysts cannot increase the distillable entanglement or distillable secret key of any bipartite state, and in particular cannot make bound entanglement distillable. Extending our construction to adaptive communication protocols, we further prove that correlated catalysts cannot enhance the two-way private-state generation capacity of any finite-dimensional quantum channel.
Motivated by the desire to better understand the class of quantum operations on bipartite systems that completely preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure-state transformations by PPT operations. Restricting our attention to the case in which we start with a rank K\mathit{K}K maximally entangled state, we give a necessary condition for transforming it into a given pure state, which we show is also sufficient when K\mathit{K}K is 2 and the final state has Schmidt rank 3. We show that it is sufficient for all K\mathit{K}K and all final states provided a conjecture about a certain family of semidefinite programs is true. We also demonstrate that the phenomenon of catalysis can occur under PPT operations and that, unlike LOCC catalysis, a maximally entangled state can be a catalyst. Finally, we give a necessary and sufficient condition for the possibility of transforming a rank K\mathit{K}K maximally entangled state to an arbitrary pure state by PPT operations assisted by some maximally entangled catalyst.
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].
Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often challenging due to the presence of noise. Typically, entanglement manipulation procedures involving asymptotically many copies of a state are considered to overcome this problem. These procedures allow for distilling highly entangled pure states from noisy states, which enables a wide range of applications, such as quantum teleportation and quantum cryptography. When it comes to manipulating entangled quantum systems on a single copy level, using entangled states as catalysts can significantly broaden the range of achievable transformations. Similar to the concept of catalysis in chemistry, the entangled catalyst is returned unchanged at the end of the state manipulation procedure. Our results demonstrate that despite the apparent conceptual differences between the asymptotic and catalytic settings, they are actually strongly connected and fully equivalent for all distillable states. Our methods rely on the analysis of many-copy entanglement manipulation procedures which may establish correlations between different copies. As an important consequence, we demonstrate that using an entangled catalyst cannot enhance the asymptotic singlet distillation rate of a distillable quantum state. Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and asymptotic state transformations of entangled states, and highlight the importance of correlations in these processes.
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.