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:0704.3348 · Physical Review A

Extreme points of the set of density matrices with positive partial transpose

Jon Magne Leinaas, Jan Myrheim, Eirik Ovrum

Published Sep 18, 2007• 38 citations
arXivHTMLPDF

Abstract

We present a necessary and sufficient condition for a finite-dimensional density matrix to be an extreme point of the convex set of density matrices with positive partial transpose with respect to a subsystem. We also give an algorithm for finding such extreme points and illustrate this by some examples.
DOI
10.1103/physreva.76.034304

Related papers

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

Global Geometric Difference Between Separable and Positive Partial Transpose States

Kil-Chan Ha, Seung-Hyeok Kye

In the convex set of all 3 ⊗ 3 states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the interior of the convex set of all separable states. In general, we need at least mn extreme points to get an interior point by their convex combination, for the case of the convex set of all m ⊗ n separable states. This shows a sharp distinction between PPT states and separable states. We also consider the same questions for positive maps and decomposable maps.

arXiv:1308.0952•Open Systems & Information Dynamics•Dec 1, 2014•0 citations

EXTREMAL DECISION RULES IN QUANTUM HYPOTHESIS TESTING

Kalyanapuram Rangachari Parthasarathy

We present a complete description of the extreme points of the convex set of all decision rules in testing multiple hypotheses concerning a quantum system whose states are described by density matrices in a finite-dimensional Hilbert space. Holevo's equations for an optimal decision are derived by methods of elementary calculus and a simple example is given in order to illustrate the nonuniqueness of optimal decision rules.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Dec 1, 1999•47 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

Separability Criterion for Density Matrices

Asher Peres

A quantum system consisting of two subsystems is separable if its density matrix can be written as $\ensuremath{\rho}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}\ensuremath{\Sigma}{A}^{}{w}_{A}{\ensuremath{\rho}}_{A}^{\ensuremath{'}}\ensuremath{\bigotimes}{\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}},$ where ${\ensuremath{\rho}}_{A}^{\ensuremath{'}}$ and ${\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}}$ are density matrices for the two subsystems, and the positive weights ${w}_{A}$ satisfy $\ensuremath{\Sigma}{w}_{A}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}1$. In this Letter, it is proved that a necessary condition for separability is that a matrix, obtained by partial transposition of \ensuremath{\rho}, has only non-negative eigenvalues. Some examples show that this criterion is more sensitive than Bell's inequality for detecting quantum inseparability.

arXiv:quant-ph/9604005•Physical Review Letters•Aug 19, 1996•5,181 citations

Extreme points of sets of absolutely separable and positive partial transpose states

Zhiwei Song, L. B. Chen

Physical Review A•Jul 22, 2025•2 citations
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.
In the convex set of all 3 ⊗ 3 states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the interior of the convex set of all separable states. In general, we need at least mn extreme points to get an interior point by their convex combination, for the case of the convex set of all m ⊗ n separable states. This shows a sharp distinction between PPT states and separable states. We also consider the same questions for positive maps and decomposable maps.
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.
A quantum system consisting of two subsystems is separable if its density matrix can be written as $\ensuremath{\rho}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}\ensuremath{\Sigma}{A}^{}{w}_{A}{\ensuremath{\rho}}_{A}^{\ensuremath{'}}\ensuremath{\bigotimes}{\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}},$ where ${\ensuremath{\rho}}_{A}^{\ensuremath{'}}$ and ${\ensuremath{\rho}}_{A}^{\ensuremath{'}\ensuremath{'}}$ are density matrices for the two subsystems, and the positive weights wA{w}_{A}wA​ satisfy $\ensuremath{\Sigma}{w}_{A}\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}1$. In this Letter, it is proved that a necessary condition for separability is that a matrix, obtained by partial transposition of \ensuremath{\rho}, has only non-negative eigenvalues. Some examples show that this criterion is more sensitive than Bell's inequality for detecting quantum inseparability.