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

Electronic Journal of Linear Algebra

On positive and positive partial transpose matrices

İbrahim Halil Gümüş, Hamid Reza Moradi, Mohammad Sababheh

Published Dec 15, 2022• 6 citations
Publisher

Abstract

A block matrix $\left[ \begin{smallmatrix}A & X \\{{X}^{*}} & B \\\end{smallmatrix} \right]$ is positive partial transpose (PPT) if both $\left[ \begin{smallmatrix}A & X \\{{X}^{*}} & B \\\end{smallmatrix} \right]$ and $\left[ \begin{smallmatrix}A & {{X}^{*}} \\X & B \\\end{smallmatrix} \right]$ are positive semi-definite. This class is significant in studying the separability criterion for density matrices. The current paper presents new relations for such matrices. This includes some equivalent forms and new related inequalities that extend some results from the literature. In the end of the paper, we present some related results for positive semi-definite block matrices, which have similar forms as those presented for PPT matrices, with applications that include significant improvement of numerical radius inequalities.

DOI
10.13001/ela.2022.7333

Related papers

Linear maps of positive partial transpose matrices and singular value inequalities

Xiaohui Fu, Pan-Shun Lau, Tin-Yau Tam

Linear maps : M n M k are called m -PPT if [(A i j )] m i, j=1 are positive partial transpose matrices for all positive semi-definite matrices

Mathematical Inequalities & Applications•Jan 1, 2020•3 citations

On Positive Partial Transpose Matrices

Mehmet Gumus, Jianzhen Liu, Samir Raouafi +1 more

This paper mainly focuses on the class of $2 \times 2$ block PPT matrices. The relationship between PPT matrices and the norm inequalities is further explored. Some properties of a non-PPT matrix in terms of its eigenvalues are investigated. Moreover, a number of useful sufficient conditions for a matrix to be PPT are provided.

Electronic Journal of Linear Algebra•May 13, 2020•1 citation

On a matrix equality involving partial transposition and its relation to the separability problem

Soni, Vaibhav, Rishone Deshwal, Garg, Aayush +2 more

In matrix theory, a well established relation $(AB)^{T}=B^{T}A^{T}$ holds for any two matrices $A$ and $B$ for which the product $AB$ is defined. Here $T$ denote the usual transposition. In this work, we explore the possibility of deriving the matrix equality $(AB)^Γ=A^ΓB^Γ$ for any $4 \times 4$ matrices $A$ and $B$, where $Γ$ denote the partial transposition. We found that, in general, $(AB)^Γ\neq A^ΓB^Γ$ holds for $4 \times 4$ matrices $A$ and $B$ but there exist particular set of $4 \times 4$ matrices for which $(AB)^Γ= A^ΓB^Γ$ holds. We have exploited this matrix equality to investigate the separability problem. Since it is possible to decompose the density matrices $ρ$ into two positive semi-definite matrices $A$ and $B$ so we are able to derive the separability condition for $ρ$ when $ρ^Γ=(AB)^Γ=A^ΓB^Γ$ holds. Due to the non-uniqueness property of the decomposition of the density matrix into two positive semi-definte matrices $A$ and $B$, there is a possibility to generalise the matrix equality for density matrices lives in higher dimension. These results may help in studying the separability problem for higher dimensional and multipartite system.

arXiv:2104.06117•Apr 13, 2021•0 citations

A note on positive partial transpose blocks

Moh. Alakhrass

In this article, we study the class of positive partial transpose blocks. We introduce several inequalities related to this class with an emphasis on comparing the main diagonal and off-diagonal components of a $ 2 \times 2 $ positive partial transpose block.

arXiv:2112.13667•AIMS Mathematics•Jan 1, 2023•3 citations

Facial structures of separable and PPT states

Seung-Hyeok Kye

A positive semi-definite block matrix (a state if it is normalized) is said to be separable if it is the sum of simple tensors of positive semi-definite matrices. A state is said to be entangled if it is not separable. It is very difficult to detect th

Banach Center Publications•Jan 1, 2011•1 citation

Does symmetry Imply PPT Property?

Daniel Cariello

Recently it was proved that many results that are true for density matrices which are positive under partial transposition (or simply PPT), also hold for another class of matrices with a certain symmetry in their Hermitian Schmidt decompositions. These matrices were called symmetric with positive coefficients (or simply SPC). A natural question appeared: What is the connection between SPC matrices and PPT matrices? Is every SPC matrix PPT? Here we show that every SPC matrix is PPT in $M_2\otimes M_2$. This theorem is a consequence of the fact that every density matrix in $M_2\otimes M_m$, with tensor rank smaller or equal to 3, is separable. Although, in $M_3\otimes M_3$, we present an example of SPC matrix with tensor rank 3 that is not PPT. We shall also provide a non trivial example of a family of matrices in $M_k\otimes M_k$, in which both, the SPC and PPT properties, are equivalent. Within this family, there exists a non trivial subfamily in which the SPC property is equivalent to separability.

arXiv:1405.3634•Quantum Information and Computation•Jul 1, 2015•7 citations
A block matrix [AXX∗B]\left[ \begin{smallmatrix}A & X \\{{X}^{*}} & B \\\end{smallmatrix} \right][AX∗​XB​] is positive partial transpose (PPT) if both [AXX∗B]\left[ \begin{smallmatrix}A & X \\{{X}^{*}} & B \\\end{smallmatrix} \right][AX∗​XB​] and [AX∗XB]\left[ \begin{smallmatrix}A & {{X}^{*}} \\X & B \\\end{smallmatrix} \right][AX​X∗B​] are positive semi-definite. This class is significant in studying the separability criterion for density matrices. The current paper presents new relations for such matrices. This includes some equivalent forms and new related inequalities that extend some results from the literature. In the end of the paper, we present some related results for positive semi-definite block matrices, which have similar forms as those presented for PPT matrices, with applications that include significant improvement of numerical radius inequalities.
This paper mainly focuses on the class of 2×22 \times 22×2 block PPT matrices. The relationship between PPT matrices and the norm inequalities is further explored. Some properties of a non-PPT matrix in terms of its eigenvalues are investigated. Moreover, a number of useful sufficient conditions for a matrix to be PPT are provided.
In matrix theory, a well established relation (AB)T=BTAT(AB)^{T}=B^{T}A^{T}(AB)T=BTAT holds for any two matrices AAA and BBB for which the product ABABAB is defined. Here TTT denote the usual transposition. In this work, we explore the possibility of deriving the matrix equality (AB)Γ=AΓBΓ(AB)^Γ=A^ΓB^Γ(AB)Γ=AΓBΓ for any 4×44 \times 44×4 matrices AAA and BBB, where ΓΓΓ denote the partial transposition. We found that, in general, (AB)Γ≠AΓBΓ(AB)^Γ\neq A^ΓB^Γ(AB)Γ=AΓBΓ holds for 4×44 \times 44×4 matrices AAA and BBB but there exist particular set of 4×44 \times 44×4 matrices for which (AB)Γ=AΓBΓ(AB)^Γ= A^ΓB^Γ(AB)Γ=AΓBΓ holds. We have exploited this matrix equality to investigate the separability problem. Since it is possible to decompose the density matrices ρρρ into two positive semi-definite matrices AAA and BBB so we are able to derive the separability condition for ρρρ when ρΓ=(AB)Γ=AΓBΓρ^Γ=(AB)^Γ=A^ΓB^ΓρΓ=(AB)Γ=AΓBΓ holds. Due to the non-uniqueness property of the decomposition of the density matrix into two positive semi-definte matrices AAA and BBB, there is a possibility to generalise the matrix equality for density matrices lives in higher dimension. These results may help in studying the separability problem for higher dimensional and multipartite system.
Recently it was proved that many results that are true for density matrices which are positive under partial transposition (or simply PPT), also hold for another class of matrices with a certain symmetry in their Hermitian Schmidt decompositions. These matrices were called symmetric with positive coefficients (or simply SPC). A natural question appeared: What is the connection between SPC matrices and PPT matrices? Is every SPC matrix PPT? Here we show that every SPC matrix is PPT in M2⊗M2M_2\otimes M_2M2​⊗M2​. This theorem is a consequence of the fact that every density matrix in M2⊗MmM_2\otimes M_mM2​⊗Mm​, with tensor rank smaller or equal to 3, is separable. Although, in M3⊗M3M_3\otimes M_3M3​⊗M3​, we present an example of SPC matrix with tensor rank 3 that is not PPT. We shall also provide a non trivial example of a family of matrices in Mk⊗MkM_k\otimes M_kMk​⊗Mk​, in which both, the SPC and PPT properties, are equivalent. Within this family, there exists a non trivial subfamily in which the SPC property is equivalent to separability.