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:quant-ph/0605036 · Physical Review Letters

Optimal Entanglement Criterion for Mixed Quantum States

Heinz‐Peter Breuer

Published Aug 22, 2006• 184 citations
arXivHTMLPDF

Abstract

We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N > or = 4. It is shown that Phi detects many entangled states with a positive partial transposition (PPT) and that it leads to a class of optimal entanglement witnesses. This implies that there are no other witnesses which can detect more entangled PPT states. The map Phi yields a systematic method for the explicit construction of high-dimensional manifolds of bound entangled states.

DOI
10.1103/physrevlett.97.080501

Related papers

Separability criteria and bounds for entanglement measures

Heinz‐Peter Breuer

Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable positive map which operates on state spaces with even dimension N >= 4, and leads to a class of nondecomposable optimal entanglement witnesses. It is shown that the bounds derived here complement and improve the existing bounds obtained from the criterion of positive partial transposition and from the realignment criterion.

arXiv:quant-ph/0606185•Journal of Physics A Mathematical and General•Sep 5, 2006•95 citations

Test for entanglement using physically observable witness operators and positive maps

Kai Chen, Ling-An Wu

Motivated by the Peres-Horodecki criterion and the realignment criterion we develop a more powerful method to identify entangled states for any bipartite system through a universal construction of the witness operator. The method also gives a new family of positive but noncompletely positive maps of arbitrary high dimensions, which provide a much better test than the witness operators themselves. Moreover, we find that there are two types of positive maps that can detect $2\ifmmode\times\else\texttimes\fi{}N$ and $4\ifmmode\times\else\texttimes\fi{}N$ bound entangled states. Since entanglement witnesses are physical observables and may be measured locally our construction could be of great significance for future experiments.

arXiv:quant-ph/0306041•Physical Review A•Feb 20, 2004•50 citations

Optimization of entanglement witnesses

Maciej Lewenstein, Barbara Kraus, J. I. Cirac +1 more

An entanglement witness (EW) is an operator that allows the detection of entangled states. We give necessary and sufficient conditions for such operators to be optimal, i.e., to detect entangled states in an optimal way. We show how to optimize general EW, and then we particularize our results to the nondecomposable ones; the latter are those that can detect positive partial transpose entangled states (PPTES's). We also present a method to systematically construct and optimize this last class of operators based on the existence of ``edge'' PPTES's, i.e., states that violate the range separability criterion [Phys. Lett. A 232, 333 (1997)] in an extreme manner. This method also permits a systematic construction of nondecomposable positive maps (PM's). Our results lead to a sufficient condition for entanglement in terms of nondecomposable EW's and PM's. Finally, we illustrate our results by constructing optimal EW acting on $H={C}^{2}\ensuremath{\bigotimes}{C}^{4}.$ The corresponding PM's constitute examples of PM's with minimal ``qubit'' domains, or---equivalently---minimal Hermitian conjugate codomains.

arXiv:quant-ph/0005014•Physical Review A•Oct 16, 2000•684 citations

Generating and detecting bound entanglement in two-qutrits using a family of indecomposable positive maps

Bihalan Bhattacharya, Suchetana Goswami, Rounak Mundra +4 more

Abstract The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to detect a class of positive partial transposed (PPT) states. A corresponding witness operator is constructed and shown to be weakly optimal and locally implementable. Further, we perform a structural physical approximation of the indecomposable map to make it a completely positive one, and find a new PPT-entangled state which is not detectable by certain other well-known entanglement detection criteria.

arXiv:2008.12971•Journal of Physics Communications•Jun 1, 2021•10 citations

Distinguishing Separable and Entangled States

Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri

We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex optimization problems known as semidefinite programs. We successfully applied the results to many low-dimensional states from the literature where the PPT test fails. As a by-product of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.

arXiv:quant-ph/0112007•Physical Review Letters•Apr 23, 2002•349 citations

Entangled States with Positive Partial Transpose in Any-Dimensional Quantum System

Yu-Chun Wu, Ping‐Xing Chen, Zheng-Wei Zhou +1 more

It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.

Chinese Physics Letters•Feb 24, 2005•2 citations
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N > or = 4. It is shown that Phi detects many entangled states with a positive partial transposition (PPT) and that it leads to a class of optimal entanglement witnesses. This implies that there are no other witnesses which can detect more entangled PPT states. The map Phi yields a systematic method for the explicit construction of high-dimensional manifolds of bound entangled states.
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable positive map which operates on state spaces with even dimension N >= 4, and leads to a class of nondecomposable optimal entanglement witnesses. It is shown that the bounds derived here complement and improve the existing bounds obtained from the criterion of positive partial transposition and from the realignment criterion.
Motivated by the Peres-Horodecki criterion and the realignment criterion we develop a more powerful method to identify entangled states for any bipartite system through a universal construction of the witness operator. The method also gives a new family of positive but noncompletely positive maps of arbitrary high dimensions, which provide a much better test than the witness operators themselves. Moreover, we find that there are two types of positive maps that can detect $2\ifmmode\times\else\texttimes\fi{}N$ and $4\ifmmode\times\else\texttimes\fi{}N$ bound entangled states. Since entanglement witnesses are physical observables and may be measured locally our construction could be of great significance for future experiments.
An entanglement witness (EW) is an operator that allows the detection of entangled states. We give necessary and sufficient conditions for such operators to be optimal, i.e., to detect entangled states in an optimal way. We show how to optimize general EW, and then we particularize our results to the nondecomposable ones; the latter are those that can detect positive partial transpose entangled states (PPTES's). We also present a method to systematically construct and optimize this last class of operators based on the existence of ``edge'' PPTES's, i.e., states that violate the range separability criterion [Phys. Lett. A 232, 333 (1997)] in an extreme manner. This method also permits a systematic construction of nondecomposable positive maps (PM's). Our results lead to a sufficient condition for entanglement in terms of nondecomposable EW's and PM's. Finally, we illustrate our results by constructing optimal EW acting on $H={C}^{2}\ensuremath{\bigotimes}{C}^{4}.$ The corresponding PM's constitute examples of PM's with minimal ``qubit'' domains, or---equivalently---minimal Hermitian conjugate codomains.
Abstract The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to detect a class of positive partial transposed (PPT) states. A corresponding witness operator is constructed and shown to be weakly optimal and locally implementable. Further, we perform a structural physical approximation of the indecomposable map to make it a completely positive one, and find a new PPT-entangled state which is not detectable by certain other well-known entanglement detection criteria.
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex optimization problems known as semidefinite programs. We successfully applied the results to many low-dimensional states from the literature where the PPT test fails. As a by-product of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.
It is well known that the positive partial transpose (PPT) criterion for determining separability is an operational separability criterion. However, in a high-dimensional (>6) situation, this criterion is not sufficient. How can we judge whether an entangled state in any high-dimensional quantum system is PPT or not? Here we propose a linear algebra method for checking the positivity of the partial transpose of a state and present a set of entangled mixed states with non-positive partial transpose.