A Cone Approach to the Quantum Separability Problem (original) (raw)
Related papers
An analytic approach to the problem of separability of quantum states based upon the theory of cones
Quantum Information Processing, 2011
Exploiting the cone structure of the set of unnormalized mixed quantum states, we offer an approach to detect separability independently of the dimensions of the subsystems. We show that any mixed quantum state can be decomposed as ρ = (1 − λ)C ρ + λE ρ , where C ρ is a separable matrix whose rank equals that of ρ and the rank of E ρ is strictly lower than that of ρ. With the simple choice C ρ = M 1 ⊗ M 2 we have a necessary condition of separability in terms of λ, which is also sufficient if the rank of E ρ equals 1. We give a first extension of this result to detect genuine entanglement in multipartite states and show a natural connection between the multipartite separability problem and the classification of pure states under stochastic local operations and classical communication. We argue that this approach is not exhausted with the first simple choices included herein.
On Entanglement and Separability
We propose two necessary sufficient (NS) criteria to decide the separability of quantum states. They follow from two independent ideas: i) the Bloch-sphere-like-representation of states and ii) the proportionality of lines (rows, columns etc.) of certain multimatrix [1] associated with states. The second criterion proposes a natural way to determine the possible partial (or total, when possible) factorization of given multipartite state and in a sense can be used to determine the structure of the entanglement. We also introduce three entanglement measures based on the proposed new characterizations of entanglement. At last we discuss the second criterion mentioned above in the language of density matrix which is an inevitable language especially for mixed states.
The Separability versus Entanglement Problem
Lectures on Quantum Information
VI. Bell inequalities A. Detection of entanglement by Bell inequality VII. Classification of bipartite states with respect to quantum dense coding A. The Holevo bound B. Capacity of quantum dense coding VIII. Further reading: Multipartite states IX. Problems References
Mixed State Entanglement Measures for Intermediate Separability
Arxiv preprint arXiv: …, 2009
To determine whether a given multipartite quantum state is separable with respect to some partition we construct a family of entanglement measures R_m. This is done utilizing generalized concurrences as building blocks which are defined by flipping of M constituents and indicate states that are separable with regard to bipartitions when vanishing. Further, we provide an analytically computable lower bound for R_m via a simple ordering relation of the convex roof extension. Using the derived lower bound, we illustrate the effect of the isotropic noise on a family of four-qubit mixed states for each intermediate separability.
Separability, entanglement, and full families of commuting normal matrices
Physical Review A, 2007
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure states constituting a decomposition of the considered mixture. The method reproduces many known entanglement and/or separability criteria, and provides yet another geometrical characterization of mixed separable states.
01 12 00 7 v 3 2 A pr 2 00 2 Distinguishing separable and entangled states
2018
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 byproduct of the criteria, we provide an explicit construction of the corresponding entanglement witnesses.
Physical Review A, 2012
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to prove that a quantum state lies within a given convex set. Our algorithm generalizes a recent algorithm for proving separability of quantum states [J. Barreiro et al., Nature Phys. 6, 943 (2010)]. We give several examples which show the wide applicability of our approach. We also propose a procedure to determine a vicinity of a given quantum state which still belongs to the considered convex set.