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

On the structure of low-rank PPT entangled states violating Peres conjecture

Gurvir Singh, Manik Banik

quant-phSubmitted Oct 14, 2026• Announced Oct 15, 2026• 0 citations
arXivHTMLPDF

Abstract

Bound-entangled states with positive partial transpose (PPT) can exhibit quantum steering and Bell nonlocality, disproving the long-standing Peres conjecture and its stronger steering counterpart. These counterexamples, obtained through explicit constructions or numerical searches, raise the question of whether they share a common structural origin. We address this question in the low-rank regime by asking whether known counterexamples can be obtained, up to invertible local filtering, from the complement of an unextendible product basis (UPB). We find that the answer depends crucially on the local dimension. In $3\otimes3$, the rank-four structure of PPT entangled states implies that both the steerable PPT state of Moroder \textit{et al.} and the Bell-nonlocal PPT state of Vértesi and Brunner can be obtained from UPB-complement states under invertible local filtering. For three qubits, in contrast, rank-four states that are PPT across every bipartition are separable across each cut. Moreover, comparison of the product-vector structure of the relevant kernels shows that the known three-qubit Bell-nonlocal PPT states cannot be obtained by invertible local filtering from the complement of any three-qubit UPB. Going beyond rank four, we further show that a known rank-eight three-qutrit state, supported on the complement of a UPB and PPT across every bipartition, is genuinely multipartite entangled. These results show that UPBs provide a unifying structural origin for important low-rank PPT entangled states in $3\otimes3$, but that nonlocal bound entanglement is not, in general, a UPB phenomenon.

Comments
12 pages. Comments are welcome!

Related papers

Low-rank extremal positive-partial-transpose states and unextendible product bases

Jon Magne Leinaas, Jan Myrheim, Per Øyvind Sollid

It is known how to construct, in a bipartite quantum system, a unique low-rank entangled mixed state with positive partial transpose (a PPT state) from an unextendible product basis (UPB), defined as an unextendible set of orthogonal product vectors. We point out that a state constructed in this way belongs to a continuous family of entangled PPT states of the same rank, all related by nonsingular unitary or nonunitary product transformations. The characteristic property of a state $\ensuremath{\rho}$ in such a family is that its kernel $\text{Ker} \ensuremath{\rho}$ has a generalized UPB, a basis of product vectors, not necessarily orthogonal, with no product vector in $\mathrm{Im} \ensuremath{\rho}$, the orthogonal complement of $\text{Ker} \ensuremath{\rho}$. The generalized UPB in $\text{Ker} \ensuremath{\rho}$ has the special property that it can be transformed to orthogonal form by a product transformation. In the case of a system of dimension $3\ifmmode\times\else\texttimes\fi{}3$, we give a complete parametrization of orthogonal UPBs. This is then a parametrization of families of rank 4 entangled (and extremal) PPT states, and we present strong numerical evidence that it is a complete classification of such states. We speculate that the lowest rank entangled and extremal PPT states also in higher dimensions are related to generalized, nonorthogonal UPBs in similar ways.

arXiv:1002.1949•Physical Review A•Jun 21, 2010•31 citations

Construction of three-qubit positive-partial-transpose entangled states of rank four

Yonggang Cheng, Lin Chen

Multiqubit positive-partial-transpose (PPT) entangled states play an important role in quantum information theory. We characterize such states of minimum rank in three-qubit system, namely rank four. Depending on whether the Lorentz invariant is zero, we classify such states into two types. The PPT entangled states constructed by unextendible product bases (UPB) have nonzero invariants, which belong to type I. We provide a method to effectively determine whether a state can be constructed from UPB. For states with zero invariant, which belong to type II, we provide an explicit expression up to equivalence of stochastic local operations and classical communications (SLOCC). It turns out that we can represent them with only one complex parameter. We further study SLOCC-equivalence relation within the expression. We also investigate the Lorentz invariants of multiqubit states with rank less than three and analyze their range.

quant-pharXiv:2605.19530•May 20, 2026•0 citations

New family of bound entangled states residing on the boundary of Peres set

Saronath Halder, Manik Banik, Sibasish Ghosh A

Bound entangled (BE) states are strange in nature: non-zero amount of free entanglement is required to create them but no free entanglement can be distilled from them under local operations and classical communication (LOCC). Even though usefulness of such states has been shown in several information processing tasks, there exists no simple method to characterize all these states for an arbitrary composite quantum system. Here we present a $(d-3)/2$-parameter family of BE states each with positive partial transpose (PPT). This family of PPT-BE states is introduced by constructing an unextendible product basis (UPB) in $\mathbb{C}^d\otimes\mathbb{C}^d$ with $d$ odd and $d\ge 5$. We also provide the `tile structure' corresponding to these UPBs. The range of each such PPT-BE state is contained in a $2(d-1)$ dimensional entangled subspace whereas the associated UPB-subspace is of dimension $(d-1)^2+1$. We further show that each of these PPT-BE states can be written as a convex combination of $(d-1)/2$ number of rank-4 PPT-BE states. Moreover, we prove that these rank-4 PPT-BE states are extreme points of the convex compact set $\mathcal{P}$ of all PPT states in $\mathbb{C}^d\otimes\mathbb{C}^d$, namely the {\it Peres} set. An interesting geometric implication of our result is that the convex hull of these rank-4 PPT-BE extreme points -- the $(d-3)/2$-simplex -- is sitting on the boundary between the set $\mathcal{P}$ and the set of non-PPT states. We also discuss consequences of our construction in the context of quantum state discrimination by LOCC.

•Jan 1, 2018•4 citations

Unextendible product bases and extremal density matrices with positive partial transpose

Per Øyvind Sollid, Jon Magne Leinaas, Jan Myrheim

In bipartite quantum systems of dimension $3\ifmmode\times\else\texttimes\fi{}3$, entangled states that are positive under partial transposition (PPT) can be constructed with the use of unextendible product bases (UPBs). As discussed in a previous publication, all the lowest rank entangled PPT states of this system seem to be equivalent, under $\mathrm{SL}\ensuremath{\bigotimes}\mathrm{SL}$ transformations, to states that are constructed in this way. Here we consider a possible generalization of the UPB constuction to low-rank entangled PPT states in higher dimensions. The idea is to give up the condition of orthogonality of the product vectors, while keeping the relation between the density matrix and the projection on the subspace defined by the UPB. We examine first this generalization for the $3\ifmmode\times\else\texttimes\fi{}3$ system where numerical studies indicate that one-parameter families of such generalized states can be found. Similar numerical searches in higher dimensional systems show the presence of extremal PPT states of similar form. Based on these results we suggest that the UPB construction of the lowest rank entangled states in the $3\ifmmode\times\else\texttimes\fi{}3$ system can be generalized to higher dimensions, with the use of nonorthogonal UPBs.

arXiv:1104.1318•Physical Review A•Oct 13, 2011•30 citations

Bound entangled states with positive partial transposition based on UPB in three-qudit system

Bichen Che, Zhao Dou, XIUBO CHEN +3 more

Abstract In this work, we concentrate on identifying bound entangled states with positive partial transposition in tripartite system. Since directly extending PPT-BE states from bipartite to tripartite systems is nontrivial, we adopt unextendible product bases (UPBs) as a tool to generate tripartite PPT-BE states. First, a set of UPB with cardinalities d 3 − 4 d + 3 is presented to characterize the extremal states of PPT set in the C d ⨂ C d ⨂ C d system. Using this basis, the missing states are introduced and employed to identify a 2 d − 1 -parameter family of PPT entangled edge states. Additionally, a generation circuit is provided which transforms the states in Z-basis to the missing states in three-qudit composite system. This circuit intuitively reflects the structure of the missing states and prepares for the generation of PPT entangled states. Our work demonstrates a different construction method of PPT entangled edge states in higher-dimensional multipartite system, providing a general insight into the relationship between nonlocality and entanglement in such system.

Physica Scripta•Mar 31, 2026•0 citations

Low-rank positive-partial-transpose states and their relation to product vectors

Leif Ove Hansen, Andreas Hauge, Jan Myrheim +1 more

Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.

arXiv:1104.1519•Physical Review A•Feb 6, 2012•16 citations
Bound-entangled states with positive partial transpose (PPT) can exhibit quantum steering and Bell nonlocality, disproving the long-standing Peres conjecture and its stronger steering counterpart. These counterexamples, obtained through explicit constructions or numerical searches, raise the question of whether they share a common structural origin. We address this question in the low-rank regime by asking whether known counterexamples can be obtained, up to invertible local filtering, from the complement of an unextendible product basis (UPB). We find that the answer depends crucially on the local dimension. In 3⊗33\otimes33⊗3, the rank-four structure of PPT entangled states implies that both the steerable PPT state of Moroder \textit{et al.} and the Bell-nonlocal PPT state of Vértesi and Brunner can be obtained from UPB-complement states under invertible local filtering. For three qubits, in contrast, rank-four states that are PPT across every bipartition are separable across each cut. Moreover, comparison of the product-vector structure of the relevant kernels shows that the known three-qubit Bell-nonlocal PPT states cannot be obtained by invertible local filtering from the complement of any three-qubit UPB. Going beyond rank four, we further show that a known rank-eight three-qutrit state, supported on the complement of a UPB and PPT across every bipartition, is genuinely multipartite entangled. These results show that UPBs provide a unifying structural origin for important low-rank PPT entangled states in 3⊗33\otimes33⊗3, but that nonlocal bound entanglement is not, in general, a UPB phenomenon.
It is known how to construct, in a bipartite quantum system, a unique low-rank entangled mixed state with positive partial transpose (a PPT state) from an unextendible product basis (UPB), defined as an unextendible set of orthogonal product vectors. We point out that a state constructed in this way belongs to a continuous family of entangled PPT states of the same rank, all related by nonsingular unitary or nonunitary product transformations. The characteristic property of a state $\ensuremath{\rho}$ in such a family is that its kernel $\text{Ker} \ensuremath{\rho}$ has a generalized UPB, a basis of product vectors, not necessarily orthogonal, with no product vector in $\mathrm{Im} \ensuremath{\rho}$, the orthogonal complement of $\text{Ker} \ensuremath{\rho}$. The generalized UPB in $\text{Ker} \ensuremath{\rho}$ has the special property that it can be transformed to orthogonal form by a product transformation. In the case of a system of dimension $3\ifmmode\times\else\texttimes\fi{}3$, we give a complete parametrization of orthogonal UPBs. This is then a parametrization of families of rank 4 entangled (and extremal) PPT states, and we present strong numerical evidence that it is a complete classification of such states. We speculate that the lowest rank entangled and extremal PPT states also in higher dimensions are related to generalized, nonorthogonal UPBs in similar ways.
Multiqubit positive-partial-transpose (PPT) entangled states play an important role in quantum information theory. We characterize such states of minimum rank in three-qubit system, namely rank four. Depending on whether the Lorentz invariant is zero, we classify such states into two types. The PPT entangled states constructed by unextendible product bases (UPB) have nonzero invariants, which belong to type I. We provide a method to effectively determine whether a state can be constructed from UPB. For states with zero invariant, which belong to type II, we provide an explicit expression up to equivalence of stochastic local operations and classical communications (SLOCC). It turns out that we can represent them with only one complex parameter. We further study SLOCC-equivalence relation within the expression. We also investigate the Lorentz invariants of multiqubit states with rank less than three and analyze their range.
Bound entangled (BE) states are strange in nature: non-zero amount of free entanglement is required to create them but no free entanglement can be distilled from them under local operations and classical communication (LOCC). Even though usefulness of such states has been shown in several information processing tasks, there exists no simple method to characterize all these states for an arbitrary composite quantum system. Here we present a (d−3)/2(d-3)/2(d−3)/2-parameter family of BE states each with positive partial transpose (PPT). This family of PPT-BE states is introduced by constructing an unextendible product basis (UPB) in Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd with ddd odd and d≥5d\ge 5d≥5. We also provide the `tile structure' corresponding to these UPBs. The range of each such PPT-BE state is contained in a 2(d−1)2(d-1)2(d−1) dimensional entangled subspace whereas the associated UPB-subspace is of dimension (d−1)2+1(d-1)^2+1(d−1)2+1. We further show that each of these PPT-BE states can be written as a convex combination of (d−1)/2(d-1)/2(d−1)/2 number of rank-4 PPT-BE states. Moreover, we prove that these rank-4 PPT-BE states are extreme points of the convex compact set P\mathcal{P}P of all PPT states in Cd⊗Cd\mathbb{C}^d\otimes\mathbb{C}^dCd⊗Cd, namely the {\it Peres} set. An interesting geometric implication of our result is that the convex hull of these rank-4 PPT-BE extreme points -- the (d−3)/2(d-3)/2(d−3)/2-simplex -- is sitting on the boundary between the set P\mathcal{P}P and the set of non-PPT states. We also discuss consequences of our construction in the context of quantum state discrimination by LOCC.
In bipartite quantum systems of dimension $3\ifmmode\times\else\texttimes\fi{}3$, entangled states that are positive under partial transposition (PPT) can be constructed with the use of unextendible product bases (UPBs). As discussed in a previous publication, all the lowest rank entangled PPT states of this system seem to be equivalent, under $\mathrm{SL}\ensuremath{\bigotimes}\mathrm{SL}$ transformations, to states that are constructed in this way. Here we consider a possible generalization of the UPB constuction to low-rank entangled PPT states in higher dimensions. The idea is to give up the condition of orthogonality of the product vectors, while keeping the relation between the density matrix and the projection on the subspace defined by the UPB. We examine first this generalization for the $3\ifmmode\times\else\texttimes\fi{}3$ system where numerical studies indicate that one-parameter families of such generalized states can be found. Similar numerical searches in higher dimensional systems show the presence of extremal PPT states of similar form. Based on these results we suggest that the UPB construction of the lowest rank entangled states in the $3\ifmmode\times\else\texttimes\fi{}3$ system can be generalized to higher dimensions, with the use of nonorthogonal UPBs.
Abstract In this work, we concentrate on identifying bound entangled states with positive partial transposition in tripartite system. Since directly extending PPT-BE states from bipartite to tripartite systems is nontrivial, we adopt unextendible product bases (UPBs) as a tool to generate tripartite PPT-BE states. First, a set of UPB with cardinalities d 3 − 4 d + 3 is presented to characterize the extremal states of PPT set in the C d ⨂ C d ⨂ C d system. Using this basis, the missing states are introduced and employed to identify a 2 d − 1 -parameter family of PPT entangled edge states. Additionally, a generation circuit is provided which transforms the states in Z-basis to the missing states in three-qudit composite system. This circuit intuitively reflects the structure of the missing states and prepares for the generation of PPT entangled states. Our work demonstrates a different construction method of PPT entangled edge states in higher-dimensional multipartite system, providing a general insight into the relationship between nonlocality and entanglement in such system.
Deciding whether a mixed quantum state is separable or entangled is a difficult problem in general. Separable states are positive under partial transposition [they are positive-partial-transpose (PPT) states], but this simple test does not exclude all entangled states. In order to understand the entangled PPT states, having so-called bound entanglement, we want to study the extremal PPT states. An extremal PPT state is either a pure product state, then it is separable, or it is entangled, in which case the state and its partial transpose must still be rather low-rank density matrices, although it is known that the rank must be at least 4. In a previous paper we presented a complete classification of the rank-4 entangled PPT states in dimension $3\ifmmode\times\else\texttimes\fi{}3$, generalizing the construction by Bennett et al. from unextendible sets of orthogonal product vectors. In the present paper we continue our investigations of the low-rank entangled PPT states, mostly in dimension $3\ifmmode\times\else\texttimes\fi{}3$, using a combination of analytical and numerical methods. We use perturbation theory in order to construct rank-5 entangled PPT states close to the known rank-4 states, and in order to compute dimensions and study the geometry of surfaces of low-rank PPT states. We exploit the close connection between low-rank PPT states and product vectors. In particular, we show how to reconstruct a low-rank PPT state from a sufficient number of product vectors in its kernel. It may seem surprising that the number of product vectors needed may be smaller than the dimension of the kernel.