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:2003.00607 · IEEE Transactions on Information Theory

Internal Boundary Between Entanglement and Separability Within a Quantum State

Bang-Hai Wang

Published Sep 8, 2022• 9 citations
arXivHTMLPDF

Abstract

Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and sufficient, and operational separability condition to determine whether an arbitrary quantum state is entangled or separable. In this paper, we show that whether a quantum state is entangled or not is determined by a threshold within the quantum state. We first introduce the concept of finer and optimal separable states based on the properties of separable states in the role of higher-level witnesses. Then we show that any bipartite quantum state can be decomposed into a convex mixture of its optimal entangled state and its optimal separable state. Furthermore, we show that whether an arbitrary quantum state is entangled or separable, as well as positive partial transposition (PPT) or not, is determined by the robustness of its optimal entangled state to its optimal separable state with reference to a crucial threshold. Moreover, for an arbitrary quantum state, we provide operational algorithms to obtain its optimal entangled state, its optimal separable state, its best separable approximation (BSA) decomposition, and its best PPT approximation decomposition. And the open question of how to calculate the BSA in high-dimension systems is partially done.

DOI
10.1109/tit.2022.3204712

Related papers

Separable approximations of density matrices of composite quantum systems

Sinisa Karnas, Maciej Lewenstein

We investigate optimal separable approximations (decompositions) of states ϱ of bipartite quantum systems A and B of arbitrary dimensions M × N following the lines of Lewenstein and Sanpera. Such approximations allow to represent in an optimal way any density operator as a sum of a separable state and an entangled state of a certain form. For two-qubit systems ( M = N = 2) the best separable approximation has the form of a mixture of a separable state and a projector onto a pure entangled state. We formulate a necessary condition that the pure state in the best separable approximation is not maximally entangled. We demonstrate that the weight of the entangled state in the best separable approximation in arbitrary dimensions provides a good entanglement measure. We prove for arbitrary M and N that the best separable approximation corresponds to a mixture of separable and entangled states, both of which are unique. We develop also a theory of optimal separable approximations for states with positive partial transpose (PPT states). Such approximations allow to decompose any density operator with positive partial transpose as a sum of a separable state and an entangled PPT state. We discuss procedures for constructing such decompositions.

arXiv:quant-ph/0011066•Journal of Physics A Mathematical and General•Aug 24, 2001•60 citations

Quantum separability and entanglement detection via entanglement-witness search and global optimization

Lawrence M. Ioannou, B. C. Travaglione

We focus on determining the separability of an unknown bipartite quantum state $\ensuremath{\rho}$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal observables. We review the concept of an entanglement witness from the geometrical point of view and use this geometry to show that the set of separable states is not a polytope and to characterize the class of entanglement witnesses (observables) that detect entangled states on opposite sides of the set of separable states. All this serves to motivate a classical algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of observables. The idea of such an algorithm, which is an efficient reduction of the quantum separability problem to a global optimization problem, was introduced by [Ioannou et al., Phys. Rev. A 70, 060303(R)], where it was shown to be an improvement on the naive approach for the quantum separability problem (exhaustive search for a decomposition of the given state into a convex combination of separable states). The last section of the paper discusses in more generality such algorithms, which, in our case, assume a subroutine that computes the global maximum of a real function of several variables. Despite this, we anticipate that such algorithms will perform sufficiently well on small instances that they will render a feasible test for separability in some cases of interest (e.g., in $3\ifmmode\times\else\texttimes\fi{}3$ dimensional systems).

arXiv:quant-ph/0602223•Physical Review A•May 23, 2006•25 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

A Necessary and Sufficient Criterion for the Separability of Quantum State

Junli Li, Cong‐Feng Qiao

Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system. In this work we propose an operational necessary and sufficient criterion for the separability of an arbitrary bipartite mixed state, by virtue of the multiplicative Horn's problem. The work follows the work initiated by Horodecki et al. and uses the Bloch vector representation introduced to the separability problem by J. De Vicente. In our criterion, a complete and finite set of inequalities to determine the separability of compound system is obtained, which may be viewed as trade-off relations between the quantumness of subsystems. We apply the obtained result to explicit examples, e.g. the separable decomposition of arbitrary dimension Werner state and isotropic state.

arXiv:1607.03364•Scientific Reports•Jan 17, 2018•35 citations

Necessary and sufficient conditions for bipartite entanglement

Jan Sperling, W. Vogel

Necessary and sufficient conditions for bipartite entanglement are derived, which apply to arbitrary Hilbert spaces. Motivated by the concept of witnesses, optimized entanglement inequalities are formulated solely in terms of arbitrary Hermitian operators, which makes them useful for applications in experiments. The needed optimization procedure is based on a separability eigenvalue problem, whose analytical solutions are derived for a special class of projection operators. For general Hermitian operators, a numerical implementation of entanglement tests is proposed. It is also shown how to identify bound entangled states with positive partial transposition.

arXiv:0805.1318•Physical Review A•Feb 19, 2009•102 citations

Separable Multipartite Mixed States: Operational Asymptotically Necessary and Sufficient Conditions

Fernando G. S. L. Brandão, Reinaldo O. Vianna

We introduce an operational procedure to determine, with arbitrary probability and accuracy, optimal entanglement witnesses for every multipartite entangled state. This method provides an operational criterion for separability which is asymptotically necessary and sufficient. Our results are also generalized to detect all different types of multipartite entanglement.

arXiv:quant-ph/0405063•Physical Review Letters•Nov 24, 2004•74 citations
Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and sufficient, and operational separability condition to determine whether an arbitrary quantum state is entangled or separable. In this paper, we show that whether a quantum state is entangled or not is determined by a threshold within the quantum state. We first introduce the concept of finer and optimal separable states based on the properties of separable states in the role of higher-level witnesses. Then we show that any bipartite quantum state can be decomposed into a convex mixture of its optimal entangled state and its optimal separable state. Furthermore, we show that whether an arbitrary quantum state is entangled or separable, as well as positive partial transposition (PPT) or not, is determined by the robustness of its optimal entangled state to its optimal separable state with reference to a crucial threshold. Moreover, for an arbitrary quantum state, we provide operational algorithms to obtain its optimal entangled state, its optimal separable state, its best separable approximation (BSA) decomposition, and its best PPT approximation decomposition. And the open question of how to calculate the BSA in high-dimension systems is partially done.
We investigate optimal separable approximations (decompositions) of states ϱ of bipartite quantum systems A and B of arbitrary dimensions M × N following the lines of Lewenstein and Sanpera. Such approximations allow to represent in an optimal way any density operator as a sum of a separable state and an entangled state of a certain form. For two-qubit systems ( M = N = 2) the best separable approximation has the form of a mixture of a separable state and a projector onto a pure entangled state. We formulate a necessary condition that the pure state in the best separable approximation is not maximally entangled. We demonstrate that the weight of the entangled state in the best separable approximation in arbitrary dimensions provides a good entanglement measure. We prove for arbitrary M and N that the best separable approximation corresponds to a mixture of separable and entangled states, both of which are unique. We develop also a theory of optimal separable approximations for states with positive partial transpose (PPT states). Such approximations allow to decompose any density operator with positive partial transpose as a sum of a separable state and an entangled PPT state. We discuss procedures for constructing such decompositions.
We focus on determining the separability of an unknown bipartite quantum state $\ensuremath{\rho}$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal observables. We review the concept of an entanglement witness from the geometrical point of view and use this geometry to show that the set of separable states is not a polytope and to characterize the class of entanglement witnesses (observables) that detect entangled states on opposite sides of the set of separable states. All this serves to motivate a classical algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of observables. The idea of such an algorithm, which is an efficient reduction of the quantum separability problem to a global optimization problem, was introduced by [Ioannou et al., Phys. Rev. A 70, 060303(R)], where it was shown to be an improvement on the naive approach for the quantum separability problem (exhaustive search for a decomposition of the given state into a convex combination of separable states). The last section of the paper discusses in more generality such algorithms, which, in our case, assume a subroutine that computes the global maximum of a real function of several variables. Despite this, we anticipate that such algorithms will perform sufficiently well on small instances that they will render a feasible test for separability in some cases of interest (e.g., in $3\ifmmode\times\else\texttimes\fi{}3$ dimensional systems).
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.
Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system. In this work we propose an operational necessary and sufficient criterion for the separability of an arbitrary bipartite mixed state, by virtue of the multiplicative Horn's problem. The work follows the work initiated by Horodecki et al. and uses the Bloch vector representation introduced to the separability problem by J. De Vicente. In our criterion, a complete and finite set of inequalities to determine the separability of compound system is obtained, which may be viewed as trade-off relations between the quantumness of subsystems. We apply the obtained result to explicit examples, e.g. the separable decomposition of arbitrary dimension Werner state and isotropic state.
Necessary and sufficient conditions for bipartite entanglement are derived, which apply to arbitrary Hilbert spaces. Motivated by the concept of witnesses, optimized entanglement inequalities are formulated solely in terms of arbitrary Hermitian operators, which makes them useful for applications in experiments. The needed optimization procedure is based on a separability eigenvalue problem, whose analytical solutions are derived for a special class of projection operators. For general Hermitian operators, a numerical implementation of entanglement tests is proposed. It is also shown how to identify bound entangled states with positive partial transposition.