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

Springer optimization and its applications

Positive Partial Transpose Matrix Inequalities

Mohammad Bagher Ghaemi, Nahid Gharakhanlu, Themistocles M. Rassias, Reza Saadati

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-3-030-76047-2_6

Related papers

Partial trace inequalities for partial transpose of positive semidefinite block matrices

Junjian Yang, Huan Xu

Positivity•Mar 14, 2024•0 citations

On positive and positive partial transpose matrices

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

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.

Electronic Journal of Linear Algebra•Dec 15, 2022•6 citations

Inequalities related to partial transpose and partial trace

Daeshik Choi

Linear Algebra and its Applications•Nov 23, 2016•10 citations

Partial transpose criteria for symmetric states

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-$j$ state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.

arXiv:1606.07635•Physical Review A•Oct 31, 2016•28 citations

Multivariate Trace Inequalities

David Sutter

SpringerBriefs in mathematical physics•Jan 1, 2018•8 citations

Positive partial transpose from spectra

Roland Hildebrand

In this paper we solve the following problem. Let ${\mathcal{H}}_{nm}$ be a Hilbert space of dimension $nm$, and let $A$ be a positive semidefinite self-adjoint linear operator on ${\mathcal{H}}_{nm}$. Under which conditions on the spectrum has $A$ a positive partial transpose (is PPT) with respect to any partition ${\mathcal{H}}_{n}\ensuremath{\bigotimes}{\mathcal{H}}_{m}$ of the space ${\mathcal{H}}_{nm}$ as a tensor product of an $n$-dimensional and an $m$-dimensional Hilbert space? We show that the necessary and sufficient conditions can be expressed as a set of linear matrix inequalities (LMIs) on the eigenvalues of $A$.

arXiv:quant-ph/0502170•Physical Review A•Nov 28, 2007•59 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.
We express the positive-partial-transpose (PPT) separability criterion for symmetric states of multiqubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-jjj state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a two-qubit system and the Bell bases used for the teleportation of a one- or two-qubit state.
In this paper we solve the following problem. Let Hnm{\mathcal{H}}_{nm}Hnm​ be a Hilbert space of dimension nmnmnm, and let AAA be a positive semidefinite self-adjoint linear operator on Hnm{\mathcal{H}}_{nm}Hnm​. Under which conditions on the spectrum has AAA a positive partial transpose (is PPT) with respect to any partition ${\mathcal{H}}_{n}\ensuremath{\bigotimes}{\mathcal{H}}_{m}$ of the space Hnm{\mathcal{H}}_{nm}Hnm​ as a tensor product of an nnn-dimensional and an mmm-dimensional Hilbert space? We show that the necessary and sufficient conditions can be expressed as a set of linear matrix inequalities (LMIs) on the eigenvalues of AAA.