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

Physical Review A

Numerical studies of entangled positive-partial-transpose states in composite quantum systems

Jon Magne Leinaas, Jan Myrheim, Per Øyvind Sollid

Published Jun 21, 2010• 36 citations
Publisher

Abstract

We report here on the results of numerical searches for PPT states in a series of bipartite quantum systems of low dimensions. PPT states are represented by density matrices that remain positive semidefinite under partial transposition with respect to one of the subsystems, and our searches are for such states with specified ranks for the density matrix and its partial transpose. For a series of different ranks extremal PPT states and nonextremal entangled PPT states have been found. The results are listed in tables and charted in diagrams. Comparison of the results for systems of different dimensions reveals several regularities. We discuss lower and upper bounds on the ranks of extremal PPT states.

DOI
10.1103/physreva.81.062329

Related papers

Extremal states of positive partial transpose in a system of three qubits

Øyvind Steensgaard Garberg, Børge Irgens, Jan Myrheim

We have studied mixed states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. In random numerical searches, we find entangled PPT states with a large variety of rank combinations. For ranks equal to five or higher, we find both extremal and nonextremal PPT states of nearly every rank combination, with the restriction that the square sum of the four ranks of an extremal PPT state can be at most 193. We have studied especially the rank-four entangled PPT states, which are found to have rank four for every partial transpose. These states are all extremal because of the previously known result that every PPT state of rank three or less is separable. We find two distinct classes of rank-4444 entangled PPT states, identified by a real valued quadratic expression invariant under local $\text{SL}(2,\mathbb{C})$ transformations, mathematically equivalent to Lorentz transformations. This quadratic Lorentz invariant is nonzero for one class of states (type I in our terminology) and zero for the other class (type II). The previously known states based on unextendible product bases are a nongeneric subclass of the type-I states. We present analytical constructions of states of both types, general enough to reproduce all the rank-4444 PPT states we have found numerically. We can not exclude the possibility that there exist nongeneric rank-four PPT states that we do not find in our random numerical searches.

arXiv:1212.5036•Physical Review A•Mar 4, 2013•7 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•15 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•26 citations

Low Rank States with Bound Entanglement in a System of three qubits

Børge Irgens

We have studied mixed quantum states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. We have studied especially the rank 4444 and rank 5555 entangled PPT states.We find two distinct classes of rank four states, identified by a real valued quadratic expression invariant under local $\\sln$ transformations, mathematically equivalent to continuous Lorentz transformations. This quadratic Lorentz invariant is non-zero for one class of states (type 1) and zero for the other class (type 2). We present analytical constructions of states of both types, general enough to reproduce all the rank four PPT states we have found numerically.There are six product vectors in a generic five dimensional subspace. The product vectors are used to define SL invariants of the state and its partial transposes. We find four distinct classes of states based which invariants are conserved or not under partial transposition.We find that a state is in the equivalence class of a symmetric state when its invariants are conserved under a partial transposition, and we have shown how to transform the state into its symmetric form through Lorentz transformations.The dimensions and geometry of extremal rank 5555 PPT states has also been examined. We find that states of different types lie on surfaces of rank 5555 different dimensions. And the surfaces touch the simplex of separable states in different ways

81•Jan 1, 2013•0 citations

Four-qubit entangled symmetric states with positive partial transpositions

Jordi Tura, Remigiusz Augusiak, P. Hyllus +3 more

We solve the open question of the existence of four-qubit entangled symmetric states with positive partial transpositions (PPT states). We reach this goal with two different approaches. First, we propose a half-analytical--half-numerical method that allows us to construct multipartite PPT entangled symmetric states (PPTESSs) from the qubit-qudit PPT entangled states. Second, we adapt the algorithm allowing us to search for extremal elements in the convex set of bipartite PPT states [Phys. Rev. A 76, 034304 (2007)] to the multipartite scenario. With its aid we search for extremal four-qubit PPTESSs and show that generically they have ranks $(5,7,8)$. Finally, we provide an exhaustive characterization of these states with respect to their separability properties.

arXiv:1203.3711•Physical Review A•Jun 22, 2012•51 citations

Positive Partial Transpose States in Multipartite Quantum Systems

Øyvind Steensgaard Garberg

In this master thesis I study the extremal positive partial transpose (PPT) states of the three qubit $(2times2times2)$ system using numerical methods. Using two algorithms which locate PPT states of a specified rank and extremal PPT states respectively, I have located numerical examples of extremal PPT states with a variety of ranks. These numerical results confirm the analytical result that all PPT states of rank less than four are separable. I also derive an upper limit on the ranks of extremal PPT states. The extremal PPT states of lowest rank, the rank four states, were studied in more detail. These states were confirmed to be biseparable in accordance with both previous analytical and numerical results. The range and kernel of these states were examined for product vectors, but none were found. In an attempt to parametrize the SL$otimes$SL equivalence classes of these extremal rank four states I have studied an analytical method to construct such states based on unextendible product bases (UPBs). This method can be used to create PPT states from a single equivalence class where, by design, the kernel of all states contain a UPB and the range contains no product vectors. All states where the range is not spanned by a basis of product vectors are necessarily entangled. I also present a numerical method for creating extremal rank four states that are symmetric under various combinations of partial transposes. Numerical examination of these states reveal no product vectors in neither range nor kernel. The existence of rank four states with and without product vectors in their kernel implies the existence of at least two equivalence classes. To get a better impression of these equivalence classes I construct quantities that are invariant under SL$otimes$SL transformations and must therefore have the same value for all states in the same equivalence class. Calculating the values of these invariants for all the rank four extremal states I have generated gives a seemingly continuous range of values. This indicates that there is an infinite number of equivalence classes likely described by one or more continuous variables. The invariants also revealed an interesting set of states that may belong to a single equivalence class, where one invariant is zero and the others have identical values. This was the only equivalence class where more than one of my states were included. There is obviously something special about this class, but I do not know what it is.

66•Jan 1, 2012•1 citation
We report here on the results of numerical searches for PPT states in a series of bipartite quantum systems of low dimensions. PPT states are represented by density matrices that remain positive semidefinite under partial transposition with respect to one of the subsystems, and our searches are for such states with specified ranks for the density matrix and its partial transpose. For a series of different ranks extremal PPT states and nonextremal entangled PPT states have been found. The results are listed in tables and charted in diagrams. Comparison of the results for systems of different dimensions reveals several regularities. We discuss lower and upper bounds on the ranks of extremal PPT states.
We have studied mixed states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. In random numerical searches, we find entangled PPT states with a large variety of rank combinations. For ranks equal to five or higher, we find both extremal and nonextremal PPT states of nearly every rank combination, with the restriction that the square sum of the four ranks of an extremal PPT state can be at most 193. We have studied especially the rank-four entangled PPT states, which are found to have rank four for every partial transpose. These states are all extremal because of the previously known result that every PPT state of rank three or less is separable. We find two distinct classes of rank-4444 entangled PPT states, identified by a real valued quadratic expression invariant under local SL(2,C)\text{SL}(2,\mathbb{C})SL(2,C) transformations, mathematically equivalent to Lorentz transformations. This quadratic Lorentz invariant is nonzero for one class of states (type I in our terminology) and zero for the other class (type II). The previously known states based on unextendible product bases are a nongeneric subclass of the type-I states. We present analytical constructions of states of both types, general enough to reproduce all the rank-4444 PPT states we have found numerically. We can not exclude the possibility that there exist nongeneric rank-four PPT states that we do not find in our random numerical searches.
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.
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.
We have studied mixed quantum states in the system of three qubits with the property that all their partial transposes are positive; these are called PPT states. We classify a PPT state by the ranks of the state itself and its three single partial transposes. We have studied especially the rank 4444 and rank 5555 entangled PPT states.We find two distinct classes of rank four states, identified by a real valued quadratic expression invariant under local sln\\slnsln transformations, mathematically equivalent to continuous Lorentz transformations. This quadratic Lorentz invariant is non-zero for one class of states (type 1) and zero for the other class (type 2). We present analytical constructions of states of both types, general enough to reproduce all the rank four PPT states we have found numerically.There are six product vectors in a generic five dimensional subspace. The product vectors are used to define SL invariants of the state and its partial transposes. We find four distinct classes of states based which invariants are conserved or not under partial transposition.We find that a state is in the equivalence class of a symmetric state when its invariants are conserved under a partial transposition, and we have shown how to transform the state into its symmetric form through Lorentz transformations.The dimensions and geometry of extremal rank 5555 PPT states has also been examined. We find that states of different types lie on surfaces of rank 5555 different dimensions. And the surfaces touch the simplex of separable states in different ways
We solve the open question of the existence of four-qubit entangled symmetric states with positive partial transpositions (PPT states). We reach this goal with two different approaches. First, we propose a half-analytical--half-numerical method that allows us to construct multipartite PPT entangled symmetric states (PPTESSs) from the qubit-qudit PPT entangled states. Second, we adapt the algorithm allowing us to search for extremal elements in the convex set of bipartite PPT states [Phys. Rev. A 76, 034304 (2007)] to the multipartite scenario. With its aid we search for extremal four-qubit PPTESSs and show that generically they have ranks (5,7,8)(5,7,8)(5,7,8). Finally, we provide an exhaustive characterization of these states with respect to their separability properties.
In this master thesis I study the extremal positive partial transpose (PPT) states of the three qubit (2times2times2)(2times2times2)(2times2times2) system using numerical methods. Using two algorithms which locate PPT states of a specified rank and extremal PPT states respectively, I have located numerical examples of extremal PPT states with a variety of ranks. These numerical results confirm the analytical result that all PPT states of rank less than four are separable. I also derive an upper limit on the ranks of extremal PPT states. The extremal PPT states of lowest rank, the rank four states, were studied in more detail. These states were confirmed to be biseparable in accordance with both previous analytical and numerical results. The range and kernel of these states were examined for product vectors, but none were found. In an attempt to parametrize the SLotimesotimesotimesSL equivalence classes of these extremal rank four states I have studied an analytical method to construct such states based on unextendible product bases (UPBs). This method can be used to create PPT states from a single equivalence class where, by design, the kernel of all states contain a UPB and the range contains no product vectors. All states where the range is not spanned by a basis of product vectors are necessarily entangled. I also present a numerical method for creating extremal rank four states that are symmetric under various combinations of partial transposes. Numerical examination of these states reveal no product vectors in neither range nor kernel. The existence of rank four states with and without product vectors in their kernel implies the existence of at least two equivalence classes. To get a better impression of these equivalence classes I construct quantities that are invariant under SLotimesotimesotimesSL transformations and must therefore have the same value for all states in the same equivalence class. Calculating the values of these invariants for all the rank four extremal states I have generated gives a seemingly continuous range of values. This indicates that there is an infinite number of equivalence classes likely described by one or more continuous variables. The invariants also revealed an interesting set of states that may belong to a single equivalence class, where one invariant is zero and the others have identical values. This was the only equivalence class where more than one of my states were included. There is obviously something special about this class, but I do not know what it is.