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

Physical Review A

Range criterion for separability

Kil-Chan Ha

Published Dec 23, 2010• 5 citations
Publisher

Abstract

Horodecki formulated a remarkable criterion for separability, which is called the range criterion. This range criterion was mostly used to show that some states with positive partial transpose are entangled. In this Brief Report, we show that the range criterion is also useful to find a convex combination of product states for a separable state. For this purpose, we give an example of density matrix, which is separable in a $2\ensuremath{\bigotimes}3$ system and entangled in a $3\ensuremath{\bigotimes}2$ system at the same time. Then we illustrate the usefulness of the range criterion with this example.

DOI
10.1103/physreva.82.064103

Related papers

Separability of Mixed Quantum States: Linear Contractions and Permutation Criteria

Michał Horodecki, Paweł Horodecki, Ryszard Horodecki

Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.

Open Systems & Information Dynamics•Mar 1, 2006•141 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•366 citations

Approximating the set of separable states using the positive partial transpose test

Salman Beigi, Peter W. Shor

The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, we do not know to what extent this criterion, as well as the approximation, is efficient. In this paper, we show that the positive partial transpose test gives no bound on the distance of a density matrix from separable states. More precisely, we prove that, as the dimension of the space tends to infinity, the maximum trace distance of a positive partial transpose state from separable states tends to 1. Using similar techniques, we show that the same result holds for other well-known separability criteria such as reduction criterion, majorization criterion, and symmetric extension criterion. We also bring in evidence that the sets of positive partial transpose states and separable states have totally different shapes.

arXiv:0902.1806•Journal of Mathematical Physics•Apr 1, 2010•31 citations

Operational criterion and constructive checks for the separability of low-rank density matrices

Paweł Horodecki, Maciej Lewenstein, Guifré Vidal +1 more

We consider low-rank density operators $\ensuremath{\varrho}$ supported on a $M\ifmmode\times\else\texttimes\fi{}N$ Hilbert space for arbitrary M and N $(M<~N),$ and with a positive partial transpose (PPT) ${\ensuremath{\varrho}}^{{T}_{A}}>~0.$ For rank $r(\ensuremath{\varrho})<~N$ we prove that having a PPT is necessary and sufficient for $\ensuremath{\varrho}$ to be separable; in this case we also provide its minimal decomposition in terms of pure product states. It follows from this result that there is no rank-3 bound entangled states having a PPT. We also present a necessary and sufficient condition for the separability of generic density matrices for which the sum of the ranks of $\ensuremath{\varrho}$ and ${\ensuremath{\varrho}}^{{T}_{A}}$ satisfies $r(\ensuremath{\varrho})+r({\ensuremath{\varrho}}^{{T}_{A}})<~2MN\ensuremath{-}M\ensuremath{-}N+2.$ This separability condition has the form of a constructive check, thus also providing a pure product state decomposition for separable states, and it works in those cases where a system of couple polynomial equations has a finite number of solutions, as expected in most cases.

arXiv:quant-ph/0002089•Physical Review A•Aug 17, 2000•151 citations

Universal separability criterion for arbitrary density matrices from causal properties of separable and entangled quantum states

Gleb A. Skorobagatko

General physical background of famous Peres-Horodecki positive partial transpose (PH- or PPT-) separability criterion is revealed. Especially, the physical sense of partial transpose operation is shown to be equivalent to what one could call as the "local causality reversal" (LCR-) procedure for all separable quantum systems or to the uncertainty in a global time arrow direction in all entangled cases. Using these universal causal considerations brand new general relations for the heuristic causal separability criterion have been proposed for arbitrary [Formula: see text] density matrices acting in [Formula: see text] Hilbert spaces which describe the ensembles of N quantum systems of D eigenstates each. Resulting general formulas have been then analyzed for the widest special type of one-parametric density matrices of arbitrary dimensionality, which model a number of equivalent quantum subsystems being equally connected (EC-) with each other to arbitrary degree by means of a single entanglement parameter p. In particular, for the family of such EC-density matrices it has been found that there exists a number of N- and D-dependent separability (or entanglement) thresholds [Formula: see text] for the values of the corresponded entanglement parameter p, which in the simplest case of a qubit-pair density matrix in [Formula: see text] Hilbert space are shown to reduce to well-known results obtained earlier independently by Peres (Phys Rev Lett 77:1413-1415, 1996) and Horodecki (Phys Lett A 223(1-2):1-8, 1996). As the result, a number of remarkable features of the entanglement thresholds for EC-density matrices has been described for the first time. All novel results being obtained for the family of arbitrary EC-density matrices are shown to be applicable to a wide range of both interacting and non-interacting (at the moment of measurement) multi-partite quantum systems, such as arrays of qubits, spin chains, ensembles of quantum oscillators, strongly correlated quantum many-body systems with the possibility of many-body localization, etc.

arXiv:2012.09428•Scientific Reports•Aug 5, 2021•3 citations

ENTANGLEMENT OF CONVEX LINEAR COMBINATION AND CONSTRUCTION OF PPT ENTANGLED STATES

Wei Cheng, Fang Xu, Hua Li +1 more

Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.

International Journal of Quantum Information•Feb 1, 2013•2 citations
Horodecki formulated a remarkable criterion for separability, which is called the range criterion. This range criterion was mostly used to show that some states with positive partial transpose are entangled. In this Brief Report, we show that the range criterion is also useful to find a convex combination of product states for a separable state. For this purpose, we give an example of density matrix, which is separable in a 2\ensuremath⨂32\ensuremath{\bigotimes}32\ensuremath⨂3 system and entangled in a 3\ensuremath⨂23\ensuremath{\bigotimes}23\ensuremath⨂2 system at the same time. Then we illustrate the usefulness of the range criterion with this example.
Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation 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.
The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, we do not know to what extent this criterion, as well as the approximation, is efficient. In this paper, we show that the positive partial transpose test gives no bound on the distance of a density matrix from separable states. More precisely, we prove that, as the dimension of the space tends to infinity, the maximum trace distance of a positive partial transpose state from separable states tends to 1. Using similar techniques, we show that the same result holds for other well-known separability criteria such as reduction criterion, majorization criterion, and symmetric extension criterion. We also bring in evidence that the sets of positive partial transpose states and separable states have totally different shapes.
We consider low-rank density operators $\ensuremath{\varrho}$ supported on a $M\ifmmode\times\else\texttimes\fi{}N$ Hilbert space for arbitrary M and N (M< N),(M<~N),(M< N), and with a positive partial transpose (PPT) ${\ensuremath{\varrho}}^{{T}_{A}}>~0.$ For rank $r(\ensuremath{\varrho})<~N$ we prove that having a PPT is necessary and sufficient for $\ensuremath{\varrho}$ to be separable; in this case we also provide its minimal decomposition in terms of pure product states. It follows from this result that there is no rank-3 bound entangled states having a PPT. We also present a necessary and sufficient condition for the separability of generic density matrices for which the sum of the ranks of $\ensuremath{\varrho}$ and ${\ensuremath{\varrho}}^{{T}_{A}}$ satisfies $r(\ensuremath{\varrho})+r({\ensuremath{\varrho}}^{{T}_{A}})<~2MN\ensuremath{-}M\ensuremath{-}N+2.$ This separability condition has the form of a constructive check, thus also providing a pure product state decomposition for separable states, and it works in those cases where a system of couple polynomial equations has a finite number of solutions, as expected in most cases.
General physical background of famous Peres-Horodecki positive partial transpose (PH- or PPT-) separability criterion is revealed. Especially, the physical sense of partial transpose operation is shown to be equivalent to what one could call as the "local causality reversal" (LCR-) procedure for all separable quantum systems or to the uncertainty in a global time arrow direction in all entangled cases. Using these universal causal considerations brand new general relations for the heuristic causal separability criterion have been proposed for arbitrary [Formula: see text] density matrices acting in [Formula: see text] Hilbert spaces which describe the ensembles of N quantum systems of D eigenstates each. Resulting general formulas have been then analyzed for the widest special type of one-parametric density matrices of arbitrary dimensionality, which model a number of equivalent quantum subsystems being equally connected (EC-) with each other to arbitrary degree by means of a single entanglement parameter p. In particular, for the family of such EC-density matrices it has been found that there exists a number of N- and D-dependent separability (or entanglement) thresholds [Formula: see text] for the values of the corresponded entanglement parameter p, which in the simplest case of a qubit-pair density matrix in [Formula: see text] Hilbert space are shown to reduce to well-known results obtained earlier independently by Peres (Phys Rev Lett 77:1413-1415, 1996) and Horodecki (Phys Lett A 223(1-2):1-8, 1996). As the result, a number of remarkable features of the entanglement thresholds for EC-density matrices has been described for the first time. All novel results being obtained for the family of arbitrary EC-density matrices are shown to be applicable to a wide range of both interacting and non-interacting (at the moment of measurement) multi-partite quantum systems, such as arrays of qubits, spin chains, ensembles of quantum oscillators, strongly correlated quantum many-body systems with the possibility of many-body localization, etc.
Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.