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/0008047 · IEEE Transactions on Information Theory

A semidefinite program for distillable entanglement

Eric M. Rains

Published Jan 1, 2001• 359 citations
arXivHTMLPDF

Abstract

We show that the maximum fidelity obtained by a positive partial transpose (p.p.t.) distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new upper bounds on 2-locally distillable entanglement). In the presence of symmetry, the semidefinite program simplifies considerably, becoming a linear program in the case of isotropic and Werner states. Using these techniques, we determine the p.p.t. distillable entanglement of asymmetric Werner states and "maximally correlated" states. We conclude with a discussion of possible applications of semidefinite programming to quantum codes and 1-local distillation.

DOI
10.1109/18.959270

Related papers

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

Positive-partial-transpose-indistinguishable states via semidefinite programming

Alessandro Cosentino

We present a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under partial transpose). When the states to be distinguished are given by the tensor product of Bell states, the semidefinite program simplifies to a linear program. In Phys. Rev. Lett. 109, 020506 (2012), Yu, Duan, and Ying exhibit a set of four maximally entangled states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, which is distinguishable by any PPT measurement only with probability strictly less than 1. Using semidefinite programming, we show a tight bound of $7/8$ on this probability ($3/4$ for the case of unambiguous PPT measurements). We generalize this result by demonstrating a simple construction of a set of $k$ states in ${\mathbb{C}}^{k}\ensuremath{\bigotimes}{\mathbb{C}}^{k}$ with the same property, for any $k$ that is a power of 2. By running numerical experiments, we show the local indistinguishability of certain sets of generalized Bell states in ${\mathbb{C}}^{5}\ensuremath{\bigotimes}{\mathbb{C}}^{5}$ and ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ previously considered in the literature.

arXiv:1205.1031•Physical Review A•Jan 18, 2013•84 citations

Non-Asymptotic Entanglement Distillation

Kun Fang, Xin Wang, Marco Tomamichel +1 more

Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.

arXiv:1706.06221•IEEE Transactions on Information Theory•May 7, 2019•79 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

One-shot entanglement distillation beyond local operations and classical communication

Bartosz Regula, Kun Fang, Xin Wang +1 more

Abstract We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the ε-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.

arXiv:1906.01648•New Journal of Physics•Sep 24, 2019•40 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
We show that the maximum fidelity obtained by a positive partial transpose (p.p.t.) distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new upper bounds on 2-locally distillable entanglement). In the presence of symmetry, the semidefinite program simplifies considerably, becoming a linear program in the case of isotropic and Werner states. Using these techniques, we determine the p.p.t. distillable entanglement of asymmetric Werner states and "maximally correlated" states. We conclude with a discussion of possible applications of semidefinite programming to quantum codes and 1-local distillation.
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.
We present a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measurement (a measurement whose operators are positive under partial transpose). When the states to be distinguished are given by the tensor product of Bell states, the semidefinite program simplifies to a linear program. In Phys. Rev. Lett. 109, 020506 (2012), Yu, Duan, and Ying exhibit a set of four maximally entangled states in ${\mathbb{C}}^{4}\ensuremath{\bigotimes}{\mathbb{C}}^{4}$, which is distinguishable by any PPT measurement only with probability strictly less than 1. Using semidefinite programming, we show a tight bound of 7/87/87/8 on this probability (3/43/43/4 for the case of unambiguous PPT measurements). We generalize this result by demonstrating a simple construction of a set of kkk states in ${\mathbb{C}}^{k}\ensuremath{\bigotimes}{\mathbb{C}}^{k}$ with the same property, for any kkk that is a power of 2. By running numerical experiments, we show the local indistinguishability of certain sets of generalized Bell states in ${\mathbb{C}}^{5}\ensuremath{\bigotimes}{\mathbb{C}}^{5}$ and ${\mathbb{C}}^{6}\ensuremath{\bigotimes}{\mathbb{C}}^{6}$ previously considered in the literature.
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.
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].
Abstract We study the task of entanglement distillation in the one-shot setting under different classes of quantum operations which extend the set of local operations and classical communication (LOCC). Establishing a general formalism which allows for a straightforward comparison of their exact achievable performance, we relate the fidelity of distillation under these classes of operations with a family of entanglement monotones and the rates of distillation with a class of smoothed entropic quantities based on the hypothesis testing relative entropy. We then characterise exactly the one-shot distillable entanglement of several classes of quantum states and reveal many simplifications in their manipulation. We show in particular that the ε-error one-shot distillable entanglement of any pure state is the same under all sets of operations ranging from one-way LOCC to separability-preserving operations or operations preserving the set of states with positive partial transpose, and can be computed exactly as a quadratically constrained linear program. We establish similar operational equivalences in the distillation of isotropic and maximally correlated states, reducing the computation of the relevant quantities to linear or semidefinite programs. We also show that all considered sets of operations achieve the same performance in environment-assisted entanglement distillation from any state.
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.