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

Families of bipartite states classifiable by the positive partial transposition criterion

Frank E. S. Steinhoff, M. C. de Oliveira

Published Jun 6, 2009• 0 citations
arXivHTMLPDF

Abstract

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search of PPT bound entangled states are briefly discussed.

DOI
10.48550/arxiv.0906.1297

Related papers

Families of bipartite states classifiable by the positive partial transposition criterion

Frank E. S. Steinhoff, M. C. de Oliveira

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of thepartially transposed matrix can be inferred directly from the block structure of the globaldensity matrix. We identify from this several subfamilies in which the PPT criterion isboth necessary and sufficient. A sufficient criterion of separability is obtained, which isfundamental for the discussion. We show how several examples of states known to beclassifiable by the PPT criterion indeed belong to this general set. Possible uses of thesestates in numerical analysis of entanglement and in the search of PPT bound entangledstates are briefly discussed.

Quantum Information and Computation•May 1, 2010•2 citations

PPT classifiable families of bipartite states

Frank E. S. Steinhoff, M. C. de Oliveira

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search of PPT bound entangled states are briefly discussed.

Quantum Information and Computation•May 1, 2010•1 citation

FAMILIES OF BIPARTITE STATES CLASSIFIABLE BY THE POSITIVE PARTIAL TRANSPOSITION CRITERION

Fes Steinhoff, MC de Oliveira

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of thepartially transposed matrix can be inferred directly from the block structure of the globaldensity matrix. We identify from this several subfamilies in which the PPT criterion isboth necessary and sufficient. A sufficient criterion of separability is obtained, which isfundamental for the discussion. We show how several examples of states known to beclassifiable by the PPT criterion indeed belong to this general set. Possible uses of thesestates in numerical analysis of entanglement and in the search of PPT bound entangledstates are briefly discussed.

Web Science•Jan 1, 2010•0 citations

The generalized partial transposition criterion for infinite-dimensional quantum systems

Siqing YanYu GuoJinchuan Hou

The positive partial transposition (PPT) criterion and the realignment criterion constitute two of the most important criteria for detecting entanglement. The general- ized partial transposition (GPT) criterion which contains the PPT criterion and the realignment criterion as special cases, provides a necessary condition for a multipartite state to be separable. Here we extend the GPT criterion to the infinite- dimensional multipartite (bipartite) case and show that it includes multipartite (bipartite) PPT criterion and multipartite (bipartite) realignment criterion as special cases as well.

•Jan 1, 2014•0 citations

Class of positive-partial-transpose bound entangled states associated with almost any set of pure entangled states

Marco Piani, Caterina E. Mora

We analyze a class of entangled states for bipartite $d\ensuremath{\bigotimes}d$ systems, with $d$ nonprime. The entanglement of such states is revealed by the construction of canonically associated entanglement witnesses. The structure of the states is very simple and similar to the one of isotropic states: they are a mixture of a separable and a pure entangled state whose supports are orthogonal. Despite such a simple structure, in an opportune interval of the mixing parameter their entanglement is not revealed by partial transposition. Moreover, for a restricted set of such states, we prove that there exists an interval of the mixing parameter such that both partial transposition and realignment (i.e., all permutational criteria in the bipartite setting) fail to detect them as entangled. In the range in which the states are positive under partial transposition (PPT), they are not distillable; on the other hand, the states in the considered class are provably distillable as soon as they are nonpositive under partial transposition. The states are associated to any set of more than two pure states. The analysis is extended to the multipartite setting. By an opportune selection of the set of multipartite pure states, it is possible to construct mixed states which are PPT with respect to any choice of bipartite cuts and nevertheless exhibit genuine multipartite entanglement. Finally, we show that every $k$-positive but not completely positive map is associated to a family of nondecomposable maps.

arXiv:quant-ph/0607061•Physical Review A•Jan 4, 2007•53 citations

Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits

Christopher Popp, Beatrix C. Hiesmayr

With a probability of success of 95% we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be separable, free entangled or bound entangled. Leveraging a geometrical representation of these states in Euclidean space, novel methods are presented that allow the classification of separable and bound entangled Bell diagonal states in an efficient way. Moreover, the classification allows the precise determination of relative volumes of the classes of separable, free and bound entangled states. In detail, out of all Bell diagonal PPT states [Formula: see text] are determined to be separable while [Formula: see text] are bound entangled and only [Formula: see text] remain unclassified. Moreover, our applied criteria are compared for their effectiveness and relation as detectors of bound entanglement, which reveals that not a single criterion is capable to detect all bound entangled states.

arXiv:2205.11405•Scientific Reports•Jul 21, 2022•14 citations
We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search of PPT bound entangled states are briefly discussed.
We construct a family of bipartite states of arbitrary dimension whose eigenvalues of thepartially transposed matrix can be inferred directly from the block structure of the globaldensity matrix. We identify from this several subfamilies in which the PPT criterion isboth necessary and sufficient. A sufficient criterion of separability is obtained, which isfundamental for the discussion. We show how several examples of states known to beclassifiable by the PPT criterion indeed belong to this general set. Possible uses of thesestates in numerical analysis of entanglement and in the search of PPT bound entangledstates are briefly discussed.
We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search of PPT bound entangled states are briefly discussed.
We construct a family of bipartite states of arbitrary dimension whose eigenvalues of thepartially transposed matrix can be inferred directly from the block structure of the globaldensity matrix. We identify from this several subfamilies in which the PPT criterion isboth necessary and sufficient. A sufficient criterion of separability is obtained, which isfundamental for the discussion. We show how several examples of states known to beclassifiable by the PPT criterion indeed belong to this general set. Possible uses of thesestates in numerical analysis of entanglement and in the search of PPT bound entangledstates are briefly discussed.
The positive partial transposition (PPT) criterion and the realignment criterion constitute two of the most important criteria for detecting entanglement. The general- ized partial transposition (GPT) criterion which contains the PPT criterion and the realignment criterion as special cases, provides a necessary condition for a multipartite state to be separable. Here we extend the GPT criterion to the infinite- dimensional multipartite (bipartite) case and show that it includes multipartite (bipartite) PPT criterion and multipartite (bipartite) realignment criterion as special cases as well.
We analyze a class of entangled states for bipartite $d\ensuremath{\bigotimes}d$ systems, with ddd nonprime. The entanglement of such states is revealed by the construction of canonically associated entanglement witnesses. The structure of the states is very simple and similar to the one of isotropic states: they are a mixture of a separable and a pure entangled state whose supports are orthogonal. Despite such a simple structure, in an opportune interval of the mixing parameter their entanglement is not revealed by partial transposition. Moreover, for a restricted set of such states, we prove that there exists an interval of the mixing parameter such that both partial transposition and realignment (i.e., all permutational criteria in the bipartite setting) fail to detect them as entangled. In the range in which the states are positive under partial transposition (PPT), they are not distillable; on the other hand, the states in the considered class are provably distillable as soon as they are nonpositive under partial transposition. The states are associated to any set of more than two pure states. The analysis is extended to the multipartite setting. By an opportune selection of the set of multipartite pure states, it is possible to construct mixed states which are PPT with respect to any choice of bipartite cuts and nevertheless exhibit genuine multipartite entanglement. Finally, we show that every kkk-positive but not completely positive map is associated to a family of nondecomposable maps.
With a probability of success of 95% we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be separable, free entangled or bound entangled. Leveraging a geometrical representation of these states in Euclidean space, novel methods are presented that allow the classification of separable and bound entangled Bell diagonal states in an efficient way. Moreover, the classification allows the precise determination of relative volumes of the classes of separable, free and bound entangled states. In detail, out of all Bell diagonal PPT states [Formula: see text] are determined to be separable while [Formula: see text] are bound entangled and only [Formula: see text] remain unclassified. Moreover, our applied criteria are compared for their effectiveness and relation as detectors of bound entanglement, which reveals that not a single criterion is capable to detect all bound entangled states.