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:2402.18037 · Physical Review A

Nonpositive-transpose entanglement and bound entanglement: From distillability sets to inequalities and multivariable insights

Si-Yuan Qi, Geni Gupur, Yu-Chun Wu, Guo‐Ping Guo

Published Jul 1, 2024• 5 citations
arXivHTMLPDF

Abstract

Equivalence between positive partial transpose (PPT) entanglement and bound entanglement is a long-standing open problem in quantum information theory. Limited progress has been made so far, even on the seemingly simple case of the bound entanglement of Werner states. The primary challenge is to give a concise mathematical representation of undistillability. To this end, we propose a decomposition of the $N$-undistillability verification into $\text{log}(N)$ repeated steps of 1-undistillability verification. For Werner states' $N$-undistillability verification, a parameter interval for $N$-undistillability is given, which is independent of the dimensionality of Werner states. Equivalent forms of inequalities for both rank 1 and 2 matrices are presented, before transforming the 2-undistillability case into a matrix analysis problem. A new perspective is also attempted by seeing it as a nonconvex multivariable function, proving its critical points and conjecturing Hessian positivity, which would make them local minimums.

DOI
10.1103/physreva.110.012406

Related papers

The distillability problem revisited

Lieven Clarisse

An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem. (i) In an attempt to overcome this, we show how the distillability problem can be reformulated as a special instance of the separability problem, for which a large number of tools and techniques are available. (ii) Building up to this we also show how the problem can be formulated as a Schmidt number problem. (iii) A numerical method for detecting distillability is presented and strong evidence is given that all 1-copy undistillable Werner states are also 4-copy undistillable. (iv) The same method is used to estimate the volume of distillable states, and the results suggest that bound entanglement is primarily a phenomenon found in low dimensional quantum systems. (v) Finally, a set of one parameter states is presented which we conjecture to exhibit all forms of distillability.

arXiv:quant-ph/0510035•Quantum Information and Computation•Sep 1, 2006•18 citations

NPPT Bound Entanglement Exists

Rajiah Simon

Every dXd bipartite system is shown to have a large family of undistillable states with nonpositive partial transpose (NPPT). This family subsumes the family of conjectured NPPT bound entangled Werner states. In particular, all one-copy undistillable NPPT Werner states are shown to be bound entangled.

arXiv:quant-ph/0608250•Aug 31, 2006•10 citations

A partial-trace matrix inequality and Werner-state distillability

Zhiwei Song, Lin Chen

Motivated by the equivalent partial-trace formulations of Werner-state distillability [P. Costa Rico, Lett. Math. Phys. 115, 47 (2025); S.-Y. Qi et al., Phys. Rev. A 110, 012406 (2024)], we prove a bipartite partial-trace inequality for every matrix of rank at most two. As applications, we prove the two-copy undistillability of NPT Werner states in arbitrary local dimension, thereby resolving this open problem highlighted in [P. Horodecki et al., PRX Quantum 3, 010101 (2022)]. We further prove a two-parameter extension of the matrix inequality and show that two individually one-copy-undistillable NPT Werner states cannot activate each other's one-copy distillability. We also resolve the singular-value maximization problem associated with the two-ququart case.

quant-pharXiv:2607.23416•Jul 28, 2026•5 citations

New partial trace inequalities and distillability of Werner states

Pablo Costa Rico

Abstract One of the oldest problems in quantum information theory is to study if there exists a state with negative partial transpose which is undistillable [1]. This problem has been open for almost 30 years, and still no one has been able to give a complete answer to it. This work presents a new strategy to try to solve this problem by translating the distillability condition on the family of Werner states into a problem of partial trace inequalities, this is the aim of our first main result. As a consequence, we obtain a new bound for the 2-distillability of Werner states, which does not depend on the dimension of the system. On the other hand, our second main result provides new partial trace inequalities for bipartite systems, connecting some of them also with the separability of Werner states. Throughout this work, we also present numerous partial trace inequalities, which are valid for many families of matrices.

arXiv:2310.05726•Letters in Mathematical Physics•May 4, 2025•8 citations

Useful States and Entanglement Distillation

Felix Leditzky, Nilanjana Datta, Graeme Smith

We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way local operations and classical communication (LOCC). In both cases, the upper bound is based on a convex decomposition of the state into “useful” and “useless” quantum states. By “useful,” we mean a state whose distillable entanglement is non-negative and equal to its coherent information (and thus given by a single-letter, tractable formula). On the other hand, “useless” states are undistillable, i.e., their distillable entanglement is zero. We prove that in both settings, the distillable entanglement is convex on such decompositions. Hence, an upper bound on the distillable entanglement is obtained from the contributions of the useful states alone, being equal to the convex combination of their coherent informations. Optimizing over all such decompositions of the input state yields our upper bound. The useful and useless states are given by degradable and antidegradable states in the one-way LOCC setting, and by maximally correlated and positive partial transpose (PPT) states in the two-way LOCC setting, respectively. We also illustrate how our method can be extended to quantum channels. Interpreting our upper bound as a convex roof extension, we show that it reduces to a particularly simple, non-convex optimization problem for the classes of isotropic states and Werner states. In the one-way LOCC setting, this non-convex optimization yields an upper bound on the quantum capacity of the qubit depolarizing channel that is strictly tighter than previously known bounds for large values of the depolarizing parameter. In the two-way LOCC setting, the non-convex optimization achieves the PPT-relative entropy of entanglement for both isotropic and Werner states.

arXiv:1701.03081•IEEE Transactions on Information Theory•Nov 24, 2017•64 citations

A solution to 2-copy distillability of Werner states

Jinshi Fu, Li Gao, Sang-Jun Park

Entanglement distillation is a fundamental task in quantum information theory. In this work, we prove that Werner states in arbitrary dimension are $2$-copy distillable if and only if they are $1$-copy distillable. This answers the longstanding open question of the $2$-copy distillability of Werner states. This is an important step on determining whether every non-positive partial transpose (NPT) state is distillable, which remains one of the central open problems in the field of entanglement distillation.

quant-pharXiv:2607.21367•Jul 24, 2026•7 citations
Equivalence between positive partial transpose (PPT) entanglement and bound entanglement is a long-standing open problem in quantum information theory. Limited progress has been made so far, even on the seemingly simple case of the bound entanglement of Werner states. The primary challenge is to give a concise mathematical representation of undistillability. To this end, we propose a decomposition of the NNN-undistillability verification into log(N)\text{log}(N)log(N) repeated steps of 1-undistillability verification. For Werner states' NNN-undistillability verification, a parameter interval for NNN-undistillability is given, which is independent of the dimensionality of Werner states. Equivalent forms of inequalities for both rank 1 and 2 matrices are presented, before transforming the 2-undistillability case into a matrix analysis problem. A new perspective is also attempted by seeing it as a nonconvex multivariable function, proving its critical points and conjecturing Hessian positivity, which would make them local minimums.
An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem. (i) In an attempt to overcome this, we show how the distillability problem can be reformulated as a special instance of the separability problem, for which a large number of tools and techniques are available. (ii) Building up to this we also show how the problem can be formulated as a Schmidt number problem. (iii) A numerical method for detecting distillability is presented and strong evidence is given that all 1-copy undistillable Werner states are also 4-copy undistillable. (iv) The same method is used to estimate the volume of distillable states, and the results suggest that bound entanglement is primarily a phenomenon found in low dimensional quantum systems. (v) Finally, a set of one parameter states is presented which we conjecture to exhibit all forms of distillability.
Motivated by the equivalent partial-trace formulations of Werner-state distillability [P. Costa Rico, Lett. Math. Phys. 115, 47 (2025); S.-Y. Qi et al., Phys. Rev. A 110, 012406 (2024)], we prove a bipartite partial-trace inequality for every matrix of rank at most two. As applications, we prove the two-copy undistillability of NPT Werner states in arbitrary local dimension, thereby resolving this open problem highlighted in [P. Horodecki et al., PRX Quantum 3, 010101 (2022)]. We further prove a two-parameter extension of the matrix inequality and show that two individually one-copy-undistillable NPT Werner states cannot activate each other's one-copy distillability. We also resolve the singular-value maximization problem associated with the two-ququart case.
Abstract One of the oldest problems in quantum information theory is to study if there exists a state with negative partial transpose which is undistillable [1]. This problem has been open for almost 30 years, and still no one has been able to give a complete answer to it. This work presents a new strategy to try to solve this problem by translating the distillability condition on the family of Werner states into a problem of partial trace inequalities, this is the aim of our first main result. As a consequence, we obtain a new bound for the 2-distillability of Werner states, which does not depend on the dimension of the system. On the other hand, our second main result provides new partial trace inequalities for bipartite systems, connecting some of them also with the separability of Werner states. Throughout this work, we also present numerous partial trace inequalities, which are valid for many families of matrices.
We derive general upper bounds on the distillable entanglement of a mixed state under one-way and two-way local operations and classical communication (LOCC). In both cases, the upper bound is based on a convex decomposition of the state into “useful” and “useless” quantum states. By “useful,” we mean a state whose distillable entanglement is non-negative and equal to its coherent information (and thus given by a single-letter, tractable formula). On the other hand, “useless” states are undistillable, i.e., their distillable entanglement is zero. We prove that in both settings, the distillable entanglement is convex on such decompositions. Hence, an upper bound on the distillable entanglement is obtained from the contributions of the useful states alone, being equal to the convex combination of their coherent informations. Optimizing over all such decompositions of the input state yields our upper bound. The useful and useless states are given by degradable and antidegradable states in the one-way LOCC setting, and by maximally correlated and positive partial transpose (PPT) states in the two-way LOCC setting, respectively. We also illustrate how our method can be extended to quantum channels. Interpreting our upper bound as a convex roof extension, we show that it reduces to a particularly simple, non-convex optimization problem for the classes of isotropic states and Werner states. In the one-way LOCC setting, this non-convex optimization yields an upper bound on the quantum capacity of the qubit depolarizing channel that is strictly tighter than previously known bounds for large values of the depolarizing parameter. In the two-way LOCC setting, the non-convex optimization achieves the PPT-relative entropy of entanglement for both isotropic and Werner states.
Entanglement distillation is a fundamental task in quantum information theory. In this work, we prove that Werner states in arbitrary dimension are 222-copy distillable if and only if they are 111-copy distillable. This answers the longstanding open question of the 222-copy distillability of Werner states. This is an important step on determining whether every non-positive partial transpose (NPT) state is distillable, which remains one of the central open problems in the field of entanglement distillation.