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:0708.3980

On a characterization of PPT states

W. A. Majewski

Published Aug 29, 2007• 3 citations
arXivHTMLPDF

Abstract

We present two different descriptions of positive partially transposed (PPT) states. One is based on the theory of positive maps while the second description provides a characterization of PPT states in terms of Hilbert space vectors. Our note is based on our previous results.
DOI
10.48550/arxiv.0708.3980

Related papers

Circulant states with positive partial transpose

Dariusz Chruściński, Andrzej Kossakowski

We construct a large class of quantum $d\ensuremath{\bigotimes}d$ states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space displaying characteristic circular structure---that is why we call them circulant states. It turns out that partial transposition maps any such decomposition into another one and hence both original density matrix and its partially transposed partner share similar cyclic properties. This class contains many well-known examples of PPT states from the literature and gives rise to a huge family of completely new states.

arXiv:0705.3534•Physical Review A•Sep 10, 2007•48 citations

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•2 citations

Quantum states with strong positive partial transpose

Dariusz Chruściński, Jacek Jurkowski, Andrzej Kossakowski

We construct a large class of bipartite $M\ensuremath{\bigotimes}N$ quantum states which defines a proper subset of states with positive partial transposes (PPTs). Any state from this class has PPT but the positivity of its partial transposition is recognized with respect to canonical factorization of the original density operator. We propose to call elements from this class states with strong positive partial transposes (SPPTs). We conjecture that all SPPT states are separable.

arXiv:0710.1934•Physical Review A•Feb 25, 2008•32 citations

Permutations and quantum entanglement

Dariusz Chruściński, Andrzej Kossakowski

We construct a large class of quantum d⊗d states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space which is governed by by cyclic permutation from the symmetric group Sd-i. It turns out that partial transposition maps any such decomposition into another one corresponding to 'complementary' permutation. This class contains many well known examples of PPT states from the literature and gives rise to a huge family of completely new states.

Journal of Physics Conference Series•Mar 1, 2008•1 citation

Characterization of partial positive transposition states and measures of entanglement

W. A. Majewski, Takashi Matsuoka, Masanori Ohya

A detailed characterization of partial positive transposition (PPT) states, both in the Heisenberg and in the Schrödinger picture, is given. Measures of entanglement are defined and discussed in details. Illustrative examples are provided.

Journal of Mathematical Physics•Nov 1, 2009•10 citations

Computable Entanglement Cost under Positive Partial Transpose Operations

Ludovico Lami, Francesco Anna Mele, Bartosz Regula

Quantum information theory is plagued by the problem of regularizations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the ultimate efficiency of key operational tasks such as entanglement manipulation. Here, we consider the problem of computing the asymptotic entanglement cost of preparing noisy quantum states under quantum operations with positive partial transpose (PPT). By means of an analytical example, a previously claimed solution to this problem is shown to be incorrect. Building on a previous characterization of the PPT entanglement cost in terms of a regularized formula, we construct instead a hierarchy of semidefinite programs that bypasses the issue of regularization altogether, and converges to the true asymptotic value of the entanglement cost. Our main result establishes that this convergence happens exponentially fast, thus yielding an efficient algorithm that approximates the cost up to an additive error ϵ in time poly(D,log(1/ϵ)), where D is the underlying Hilbert space dimension. To our knowledge, this is the first time that an asymptotic entanglement measure is shown to be efficiently computable despite no closed-form formula being available.

arXiv:2405.09613•Physical Review Letters•Mar 7, 2025•4 citations
We construct a large class of quantum $d\ensuremath{\bigotimes}d$ states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space displaying characteristic circular structure---that is why we call them circulant states. It turns out that partial transposition maps any such decomposition into another one and hence both original density matrix and its partially transposed partner share similar cyclic properties. This class contains many well-known examples of PPT states from the literature and gives rise to a huge family of completely new states.
We construct a large class of quantum d⊗d states which are positive under partial transposition (so called PPT states). The construction is based on certain direct sum decomposition of the total Hilbert space which is governed by by cyclic permutation from the symmetric group Sd-i. It turns out that partial transposition maps any such decomposition into another one corresponding to 'complementary' permutation. This class contains many well known examples of PPT states from the literature and gives rise to a huge family of completely new states.
Quantum information theory is plagued by the problem of regularizations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the ultimate efficiency of key operational tasks such as entanglement manipulation. Here, we consider the problem of computing the asymptotic entanglement cost of preparing noisy quantum states under quantum operations with positive partial transpose (PPT). By means of an analytical example, a previously claimed solution to this problem is shown to be incorrect. Building on a previous characterization of the PPT entanglement cost in terms of a regularized formula, we construct instead a hierarchy of semidefinite programs that bypasses the issue of regularization altogether, and converges to the true asymptotic value of the entanglement cost. Our main result establishes that this convergence happens exponentially fast, thus yielding an efficient algorithm that approximates the cost up to an additive error ϵ in time poly(D,log(1/ϵ)), where D is the underlying Hilbert space dimension. To our knowledge, this is the first time that an asymptotic entanglement measure is shown to be efficiently computable despite no closed-form formula being available.