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:0711.2613 · IEEE Transactions on Information Theory

A Few Steps More Towards NPT Bound Entanglement

Łukasz Pankowski, Marco Piani, Michał Horodecki, Paweł Horodecki

Published Jul 21, 2010• 90 citations
arXivHTMLPDF

Abstract

In this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of its two-copy distillability, which boils down to show that maximal overlap of some projectorQwith Schmidt rank two states does not exceed 1/2 (called thehalf-property), is studied. First, it is shown that the maximum overlap can be attained on vectors that are not of the simple product form with respect to cut between two copies. Then, the problem in attacked twofold way: (a) the half-property is proved for some wide classes of Schmidt rank two states; (b) the overlap forallSchmidt rank two states is bounded from above bycA⊗I+I⊗BwithA,Btraceless 4 × 4 matrices, and TrAfA+ TrBfB=1/4.

DOI
10.1109/tit.2010.2050810

Related papers

NPT Bound Entanglement- The Problem Revisited

Indrani Chattopadhyay, Debasis Sarkar

Recently [quant-ph/0608250] again created a lot of interest to prove the existence of bound entangled states with negative partial transpose (NPT) in any $d \times d (d \geq 3)$ Hilbert space. However the proof in quant-ph/0608250 is not complete but it shows some interesting properties of the Schmidt rank two states. In this work we are trying to probe the problem in a different angle considering the work by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. We have assumed that the Schmidt rank two states should satisfy some bounds. Under some assumptions with these bounds one could prove the existence of NPT bound entangled states. We particularly discuss the case of two copy undistillability of the conjectured family of NPT states. Obviously the class of NPT bound entangled states belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. However the problem of existence of NPT bound entangled states still remain open.

arXiv:quant-ph/0609050•Sep 6, 2006•8 citations

Bound Entangled States With Negative Partial Transpose Exist

Indrani Chattopadhyay, D. Sarkar

We prove the existence of bound entangled states with negative partial transpose (NPT) in any d × d(d ≥ 3) Hilbert space with a simple assumption on Schmidt rank two states. Obviously they belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. PACS number(s): 03.67.Hk, 03.65.Ud. The basic issue on the classification of mixed state entanglement at least on the level of bipartite systems solely depends upon whether there exist bound entangled states or not. The existence of PPT-bound (PPT means positive partial transpose) entangled states [1] and also the existence of NPT N−copy undistillable states [2, 3] for every positive integer N naturally indicates there may exist NPT-bound entangled states. In this work we are able to show the existence of NPT-bound entangled states with a simple assumption on Schmidt rank two states. We first briefly describe the issue and the importance of the problem. In recent years it is found that quantum entanglement is an useful resource in performing several tasks in quantum information theory and quantum communication [4]. Maximally entangled states shared between two parties are essential ingredients in this respect [5]. Now due to the interaction with environment, states are in practice found to be mixed. However there is a process called distillation by which we can distill sometimes maximally entangled

•Sep 6, 2006•0 citations

Two-copy distillability of one-copy-undistillable negative-partial-transpose states in every dimension

Gelo Noel M. Tabia, Kai-Siang Chen, Min-Hsiu Hsieh

Whether entanglement with a negative partial transpose (NPT) can be undistillable is a longstanding open problem. In the canonical family of DiVincenzo \textit{et al.}, the one-copy-undistillable region was conjectured to remain undistillable at all copy numbers. We refute this: in every dimension $d\geq3$, one vertex of this region is two-copy distillable, via an explicit Schmidt-rank-two tight-frame witness. The separation persists on an open set, while other states in the same region are provably two-copy undistillable. Twirling our counterexample into Werner form makes it two-copy undistillable, so this standard reduction can erase finite-copy distillability.

quant-pharXiv:2608.08836•Aug 11, 2026•0 citations

Non-existence of bipartite bound entanglement with negative partial transposition

Jan Sperling, W. Vogel

Bound entanglement with a nonpositive partial transposition (NPT) does not exist. For any NPT entangled state a distillation procedure can be based on a certain number of copies. This number is the minimal Schmidt rank of a pure state needed to witness the NPT entanglement under study.

arXiv:0910.0744•Oct 5, 2009•1 citation

Classes of n -copy undistillable quantum states with negative partial transposition

Somshubhro Bandyopadhyay, Vwani Roychowdhury

The discovery of entangled quantum states from which one cannot distill pure entanglement constitutes a fundamental recent advance in the field of quantum information. Such bipartite bound-entangled (BE) quantum states could fall into two distinct categories: (1) Inseparable states with positive partial transposition (PPT), and (2) states with negative partial transposition (NPT). While the existence of PPT BE states has been confirmed, only one class of conjectured NPT BE states has been discovered so far. We provide explicit constructions of a variety of multicopy undistillable NPT states, and conjecture that they constitute families of NPT BE states. For example, we show that for every pure state of Schmidt rank greater than or equal to 3, one can construct n-copy undistillable NPT states, for any $n>~1.$ The abundance of such conjectured NPT BE states, we believe, considerably strengthens the notion that being NPT is only a necessary condition for a state to be distillable.

arXiv:quant-ph/0302093•Physical Review A•Aug 28, 2003•25 citations

Equality cases and every-copy results for the Werner endpoint inequality

Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) is distillable reduces to the case of the Werner states ρ(d,α) = (I + αF)/(d² + αd), where F is the swap. For d ≥ 3 and −1/2 ≤ α < −1/d these states are NPT but one-copy undistillable. Write a vector on k copies as a matrix C, and let Tr_J trace out the copies in J. By the Schmidt-rank criterion of DiVincenzo et al. and Dür et al. (2000), as rewritten by P. Costa Rico (2025), ρ(d,α) is k-copy undistillable exactly when Σ_J α^|J| ‖Tr_J C‖² ≥ 0 for every vector of Schmidt rank at most two on k copies. At α = −1/2 we call this the endpoint inequality. It was proved independently for two copies by Fu et al., Fraser et al., Song and Chen, and Bharti et al. (2026), and for three copies by a computer-assisted proof in the companion record doi:10.5281/zenodo.23604343. If it held for every k, NPT bound entanglement would exist. We describe its equality cases for two copies and where it could first fail, and we prove it on two classes of matrices, one for every number of copies and one for four copies. For two copies we prove that every equality case, that is, every nonzero C of rank at most two with equality in the endpoint inequality, has rank two and that the ranges of C and C* lie in products of two-dimensional single-copy subspaces. We obtain this by following the equality cases through Song and Chen's elementary proof of the two-copy inequality. Every known equality case, for any number of copies, has a range with a reduced state of rank at most two on some copy. We also show that a first failure would come with larger reduced states: if the endpoint inequality holds for k − 1 copies but fails for k, then for some α > −1/2 the inequality still holds, with equality at a nonzero C whose range has reduced states of rank at least three on every copy. This rests on a copy-removal lemma built on the separable ball of Gurvits and Barnum. We prove the endpoint inequality, for every k and d ≥ 3, for the matrices C whose range is spanned by a vector f_0 of V_0 and a vector f_1 of V_1 and whose co-range (the range of C*) is arbitrary. Here V_c is spanned by |c⟩^⊗k and the k vectors obtained from it by replacing one factor with |2⟩, for orthonormal |0⟩, |1⟩, |2⟩; for generic f_0 and f_1 the projector onto the range has reduced states of rank three on every copy, as a first failure would require. So no vector of this kind witnesses distillability of ρ(d,−1/2). Schur complements reduce the claim to a quadratic form; an induction on the number of copies then completes the argument. For four copies we establish the endpoint inequality in every dimension for all C whose range and co-range lie in one two-dimensional subspace. This class contains all normal matrices of rank two, for which Wu and Zou had proved the three-copy case (arXiv:2608.02647). Here we restrict the quartic moment relaxation used in the companion record to this class, where it involves the moments of a single vector; one exact certificate, together with an embedding into larger dimensions, then covers every dimension. For d = 3 the theorem is also proved in Lean 4 with Mathlib, in the package release_lean_commonplane. Some data checks in that proof are evaluated by compiled code (native_decide). For general C the endpoint inequality remains open from four copies on. This record contains the paper, the Lean package named above, and two packages of Python programs, each with a README that says how to run its checks. The package release_endpoint covers the computer-verified steps of the proofs, among them a symbolic check of five rational identities; these do not involve k, and checking them is the only computer step in the proof for every k. The package release_commonplane contains the four-copy certificates and two implementations of their exact checks; the second was written independently, from the definitions.

•Oct 28, 2026•1 citation
In this paper, existence of bound entangled states with nonpositive partial transpose (NPT) is considered. As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover, it would rule out a simple mathematical description of the set of distillable states. The particular state, known to be 1-copy nondistillable and supposed to be bound entangled, is considered. The problem of its two-copy distillability, which boils down to show that maximal overlap of some projectorQwith Schmidt rank two states does not exceed 1/2 (called thehalf-property), is studied. First, it is shown that the maximum overlap can be attained on vectors that are not of the simple product form with respect to cut between two copies. Then, the problem in attacked twofold way: (a) the half-property is proved for some wide classes of Schmidt rank two states; (b) the overlap forallSchmidt rank two states is bounded from above bycA⊗I+I⊗BwithA,Btraceless 4 × 4 matrices, and TrAfA+ TrBfB=1/4.
Recently [quant-ph/0608250] again created a lot of interest to prove the existence of bound entangled states with negative partial transpose (NPT) in any d×d(d≥3)d \times d (d \geq 3)d×d(d≥3) Hilbert space. However the proof in quant-ph/0608250 is not complete but it shows some interesting properties of the Schmidt rank two states. In this work we are trying to probe the problem in a different angle considering the work by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. We have assumed that the Schmidt rank two states should satisfy some bounds. Under some assumptions with these bounds one could prove the existence of NPT bound entangled states. We particularly discuss the case of two copy undistillability of the conjectured family of NPT states. Obviously the class of NPT bound entangled states belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. However the problem of existence of NPT bound entangled states still remain open.
We prove the existence of bound entangled states with negative partial transpose (NPT) in any d × d(d ≥ 3) Hilbert space with a simple assumption on Schmidt rank two states. Obviously they belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. PACS number(s): 03.67.Hk, 03.65.Ud. The basic issue on the classification of mixed state entanglement at least on the level of bipartite systems solely depends upon whether there exist bound entangled states or not. The existence of PPT-bound (PPT means positive partial transpose) entangled states [1] and also the existence of NPT N−copy undistillable states [2, 3] for every positive integer N naturally indicates there may exist NPT-bound entangled states. In this work we are able to show the existence of NPT-bound entangled states with a simple assumption on Schmidt rank two states. We first briefly describe the issue and the importance of the problem. In recent years it is found that quantum entanglement is an useful resource in performing several tasks in quantum information theory and quantum communication [4]. Maximally entangled states shared between two parties are essential ingredients in this respect [5]. Now due to the interaction with environment, states are in practice found to be mixed. However there is a process called distillation by which we can distill sometimes maximally entangled
Whether entanglement with a negative partial transpose (NPT) can be undistillable is a longstanding open problem. In the canonical family of DiVincenzo \textit{et al.}, the one-copy-undistillable region was conjectured to remain undistillable at all copy numbers. We refute this: in every dimension d≥3d\geq3d≥3, one vertex of this region is two-copy distillable, via an explicit Schmidt-rank-two tight-frame witness. The separation persists on an open set, while other states in the same region are provably two-copy undistillable. Twirling our counterexample into Werner form makes it two-copy undistillable, so this standard reduction can erase finite-copy distillability.
The discovery of entangled quantum states from which one cannot distill pure entanglement constitutes a fundamental recent advance in the field of quantum information. Such bipartite bound-entangled (BE) quantum states could fall into two distinct categories: (1) Inseparable states with positive partial transposition (PPT), and (2) states with negative partial transposition (NPT). While the existence of PPT BE states has been confirmed, only one class of conjectured NPT BE states has been discovered so far. We provide explicit constructions of a variety of multicopy undistillable NPT states, and conjecture that they constitute families of NPT BE states. For example, we show that for every pure state of Schmidt rank greater than or equal to 3, one can construct n-copy undistillable NPT states, for any n> 1.n>~1.n> 1. The abundance of such conjectured NPT BE states, we believe, considerably strengthens the notion that being NPT is only a necessary condition for a state to be distillable.
Whether every entangled state with a non-positive partial transpose (NPT) is distillable reduces to the case of the Werner states ρ(d,α) = (I + αF)/(d² + αd), where F is the swap. For d ≥ 3 and −1/2 ≤ α < −1/d these states are NPT but one-copy undistillable. Write a vector on k copies as a matrix C, and let Tr_J trace out the copies in J. By the Schmidt-rank criterion of DiVincenzo et al. and Dür et al. (2000), as rewritten by P. Costa Rico (2025), ρ(d,α) is k-copy undistillable exactly when Σ_J α^|J| ‖Tr_J C‖² ≥ 0 for every vector of Schmidt rank at most two on k copies. At α = −1/2 we call this the endpoint inequality. It was proved independently for two copies by Fu et al., Fraser et al., Song and Chen, and Bharti et al. (2026), and for three copies by a computer-assisted proof in the companion record doi:10.5281/zenodo.23604343. If it held for every k, NPT bound entanglement would exist. We describe its equality cases for two copies and where it could first fail, and we prove it on two classes of matrices, one for every number of copies and one for four copies. For two copies we prove that every equality case, that is, every nonzero C of rank at most two with equality in the endpoint inequality, has rank two and that the ranges of C and C* lie in products of two-dimensional single-copy subspaces. We obtain this by following the equality cases through Song and Chen's elementary proof of the two-copy inequality. Every known equality case, for any number of copies, has a range with a reduced state of rank at most two on some copy. We also show that a first failure would come with larger reduced states: if the endpoint inequality holds for k − 1 copies but fails for k, then for some α > −1/2 the inequality still holds, with equality at a nonzero C whose range has reduced states of rank at least three on every copy. This rests on a copy-removal lemma built on the separable ball of Gurvits and Barnum. We prove the endpoint inequality, for every k and d ≥ 3, for the matrices C whose range is spanned by a vector f_0 of V_0 and a vector f_1 of V_1 and whose co-range (the range of C*) is arbitrary. Here V_c is spanned by |c⟩^⊗k and the k vectors obtained from it by replacing one factor with |2⟩, for orthonormal |0⟩, |1⟩, |2⟩; for generic f_0 and f_1 the projector onto the range has reduced states of rank three on every copy, as a first failure would require. So no vector of this kind witnesses distillability of ρ(d,−1/2). Schur complements reduce the claim to a quadratic form; an induction on the number of copies then completes the argument. For four copies we establish the endpoint inequality in every dimension for all C whose range and co-range lie in one two-dimensional subspace. This class contains all normal matrices of rank two, for which Wu and Zou had proved the three-copy case (arXiv:2608.02647). Here we restrict the quartic moment relaxation used in the companion record to this class, where it involves the moments of a single vector; one exact certificate, together with an embedding into larger dimensions, then covers every dimension. For d = 3 the theorem is also proved in Lean 4 with Mathlib, in the package release_lean_commonplane. Some data checks in that proof are evaluated by compiled code (native_decide). For general C the endpoint inequality remains open from four copies on. This record contains the paper, the Lean package named above, and two packages of Python programs, each with a README that says how to run its checks. The package release_endpoint covers the computer-verified steps of the proofs, among them a symbolic check of five rational identities; these do not involve k, and checking them is the only computer step in the proof for every k. The package release_commonplane contains the four-copy certificates and two implementations of their exact checks; the second was written independently, from the definitions.