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/0406023 · Physical Review A

Non-full-rank bound entangled states satisfying the range criterion

Somshubhro Bandyopadhyay, Sibasish Ghosh A, Vwani Roychowdhury

Published Jan 12, 2005• 29 citations
arXivHTMLPDF

Abstract

A systematic method for generating bound entangled states in any bipartite system, with ranks ranging from five to full rank, is presented. These states are constructed by mixing separable states with unextendable product basis--generated bound entangled states that are positive under partial transposition (PPT). A subset of this class of PPT bound entangled states, having less than full rank, is shown to satisfy the range criterion [P. Horodecki, Phys. Lett. A 232, 333 (1997)].

DOI
10.1103/physreva.71.012316

Related papers

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

Generation of bipartite bound entanglement

Frank E. S. Steinhoff

We introduce a class of entangled bipartite states that are positive under partial transposition operation,i.e., PPT bound entangled states. These states are based on realistical preparation procedures in optical systems, being thus a feasible option to generate and observe bipartite bound entanglement in high precision experiments. The method employed to detect entanglement has the advantages of being simple, analitical and independent of the range criterion. We also link PPT property of one-mode states that pass a beam-splitter to Hankel operator theory and related moment problems.

Physicae Proceedings•Mar 29, 2012•0 citations

Noisy bound entangled states: construction and their detection

Saronath Halder, Ritabrata Sengupta

It is known that bound entangled states are mixed entangled states from which no pure entanglement can be distilled by local operations and classical communication. This holds true even if large number of identical copies of the state are shared between spatially separated parties. In this work we consider bipartite {\it noisy} bound entangled states with positive partial transpose, that is, such a state can be written as a convex combination of a so-called edge state and a separable state ({\it noise}). Starting from a particular class of unextendible product bases (UPBs) we first show a systematic method to construct low-rank noisy bound entangled states which satisfy the range criterion. Next, we consider different classes of uncompletable product bases (UCPBs) to construct noisy bound entangled states. A subset of these bound entangled states has the property that they satisfy the range criterion. However, UCPBs are important to produce noisy bound entangled states and thus, the problem of constructing UCPBs from different classes of UPBs is also considered in this work. In each case explicit examples are constructed. In fact, present bound entangled states help us to learn about the robustness of edge states. We also discuss about the detection these states.

•Aug 1, 2018•0 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 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

Rank-based entanglement detection for bound entangled states

Aabhas Gulati

We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.

arXiv:2506.11346•Physical Review A•Jan 2, 2026•1 citation
A systematic method for generating bound entangled states in any bipartite system, with ranks ranging from five to full rank, is presented. These states are constructed by mixing separable states with unextendable product basis--generated bound entangled states that are positive under partial transposition (PPT). A subset of this class of PPT bound entangled states, having less than full rank, is shown to satisfy the range criterion [P. Horodecki, Phys. Lett. A 232, 333 (1997)].
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.
We introduce a class of entangled bipartite states that are positive under partial transposition operation,i.e., PPT bound entangled states. These states are based on realistical preparation procedures in optical systems, being thus a feasible option to generate and observe bipartite bound entanglement in high precision experiments. The method employed to detect entanglement has the advantages of being simple, analitical and independent of the range criterion. We also link PPT property of one-mode states that pass a beam-splitter to Hankel operator theory and related moment problems.
It is known that bound entangled states are mixed entangled states from which no pure entanglement can be distilled by local operations and classical communication. This holds true even if large number of identical copies of the state are shared between spatially separated parties. In this work we consider bipartite {\it noisy} bound entangled states with positive partial transpose, that is, such a state can be written as a convex combination of a so-called edge state and a separable state ({\it noise}). Starting from a particular class of unextendible product bases (UPBs) we first show a systematic method to construct low-rank noisy bound entangled states which satisfy the range criterion. Next, we consider different classes of uncompletable product bases (UCPBs) to construct noisy bound entangled states. A subset of these bound entangled states has the property that they satisfy the range criterion. However, UCPBs are important to produce noisy bound entangled states and thus, the problem of constructing UCPBs from different classes of UPBs is also considered in this work. In each case explicit examples are constructed. In fact, present bound entangled states help us to learn about the robustness of edge states. We also discuss about the detection these states.
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.
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.
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.