David P. DiVincenzo, Barbara M. Terhal, Ashish V. Thapliyal
备注：
14 Pages (RevTeX), 1 figure (eps). Submitted to the special issue of the J. Mod. Opt. V2: Change in terminology from "ensemble length" to "ensemble cardinality"
Two families of bipartite mixed quantum states are studied for which it is proved that the number of members in the optimal-decomposition ensemble --- the ensemble realizing the entanglement of formation --- is greater than the rank of the mixed state. We find examples for which the number of states in this optimal ensemble can be larger than the rank by an arbitrarily large factor. In one case the proof relies on the fact that the partial transpose of the mixed state has zero eigenvalues; in the other case the result arises from the properties of product bases that are completable only by embedding in a larger Hilbert space.
We derive an integral convex combination of product states for a range of separable Werner states. Our method consists of expanding the sought-after local density operators in terms of Wigner operators. For dimension d=2, our decomposition holds for the whole separable range of Werner states, while for d>2 it is valid for a subset of separable Werner states. We illustrate the general method with the explicit examples d=2 and d=3.
We analyze a class of positive partial transpose states (PPT) such that the positivity of its partial transposition is recognized with respect to canonical factorization of the original density operator (Cholesky block decomposition). We call such PPT states strong PPT states (SPPT). This property, contrary to PPT, is basis dependent. It is shown that there exists a proper subset of SPPT states which are separable and provide a separable decomposition for any of these states.
We construct one parameter families of three qubit separable states with length ten, which is strictly greater than the whole dimension eight. These states are located on the boundary of the convex set of all separable states, but they are in the interior of the convex set of all states with positive partial transposes. They are also decomposed into the convex sum of ten pure product states in a unique way.
We study certain quantum states for which the PPT criterion is both sufficient and necessary for separability. A class of $n\times n$ bipartite mixed states is presented and the conditions of PPT for these states are derived. The separable pure state decompositions of these states are explicitly constructed when they are PPT.
We present a practical scheme for the decomposition of a bipartite mixed state into a sum of direct products of local density matrices, using the technique developed in Li and Qiao (Sci. Rep. 8: 1442, 2018). In the scheme, the correlation matrix which characterizes the bipartite entanglement is first decomposed into two matrices composed of the Bloch vectors of local states. Then we show that the symmetries of Bloch vectors are consistent with that of the correlation matrix, and the magnitudes of the local Bloch vectors are lower bounded by the correlation matrix. Concrete examples for the sep…
We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary composite systems and which thereby is complete for low dimensions. We then describe a constructive algorithm for finding the canonical decomposition of separable and non separable mixed states of dimensions 2x2 and 2x3.
We describe a purely algebraic method for finding the best separable approximation to a mixed state of a composite 2x2 quantum system, consisting of a decomposition of the state into a linear combination of a mixed separable part and a pure entangled one. We prove that, in a generic case, the weight of the pure part in the decomposition equals the concurrence of the state.
In the standard geometric approach to a measure of entanglement of a pure state, $\sin^2θ$ is used, where $θ$ is the angle between the state to the closest separable state of products of normalized qubit states. We consider here a generalization of this notion to separable states consisting of products of unnormalized states of different dimension. In so doing, the entanglement measure $\sin^2θ$ is found to have an interpretation as the distance between the state to the closest separable state. We also find the components of the closest separable state and its norm have an interpretation in te…
The present methods for obtaining the optimal Lewenestein- Sanpera decomposition of a mixed state are difficult to handle analytically. We provide a simple analytical expression for the optimal Lewenstein-Sanpera decomposition by using semidefinite programming. Specially, we obtain the optimal Lewenstein-Sanpera decomposition for some examples such as: Bell decomposable state, Iso-concurrence state, generic two qubit state in Wootters's basis, $2\otimes 3$ Bell decomposable state, $d\otimes d$ Werner and isotropic states, a one parameter $3\otimes 3$ state and finally multi partite isotropic s…
We prove that every symmetric separable state admits a convex decomposition into symmetric pure product states. While the result is not new in itself, here we focus on convex geometry. We discuss the decomposition in the context of numerical ranges and ground state problems of infinite bosonic systems.
By definition a separable state has the form \sum A_i \otimes B_i, where 0 \leq A_i, B_i for each i. In this paper we consider the class of states which admit such a decomposition with B_1, ..., B_p having independent images. We give a simple intrinsic characterization of this class of states, and starting with a density matrix in this class, describe a procedure to find such a decomposition with B_1, ..., B_p having independent images, and A_1, ..., A_p being distinct with unit trace. Such a decomposition is unique, and we relate this to the facial structure of the set of separable states. A …
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)]. 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 a 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 t…
The decompositions of separable Werner state, and also isotropic state, are well-known tough issues in quantum information theory, in this work we investigate them in the Bloch vector representation, exploring the symmetric informationally complete positive operator-valued measure (SIC-POVM) in the Hilbert space. We successfully get the decomposition for arbitrary $N\times N$ Werner state in terms of regular simplexes. Meanwhile, the decomposition of isotropic state is found to be related to the decomposition of Werner state via partial transposition. It is interesting to note that in the larg…
In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this decomposition is a supersymmetric pure product state $|x,x\rangle\langle x,x|$, which are called S-separable. We conjecture that any supersymmetric states are S-separable and we prove that this conjecture holds when the rank is less than or equal to 3 or $N$. Moreover, we propose another weaker conjecture that any separable supersymmetric states are S-separable. It …
We study six natural decompositions of mixed states in one spatial dimension: the Matrix Product Density Operator (MPDO) form, the local purification form, the separable decomposition (for separable states), and their three translational invariant (t.i.) analogues. For bipartite states diagonal in the computational basis, we show that these decompositions correspond to well-studied factorisations of an associated nonnegative matrix. Specifically, the first three decompositions correspond to the minimal factorisation, the nonnegative factorisation, and the positive semidefinite factorisation. W…
We investigate conditions on a finite set of multi-partite product vectors for which separable states with corresponding product states have unique decomposition, and show that this is true in most cases if the number of product vectors is sufficiently small. In the three qubit case, generic five dimensional spaces give rise to faces of the convex set consisting of all separable states, which are affinely isomorphic to the five dimensional simplex with six vertices. As a byproduct, we construct three qubit entangled PPT edge states of rank four with explicit formulae. This covers those entangl…
We provide an analytical expression for optimal Lewenstein-Sanpera decomposition of Bell decomposable states by using semi-definite programming. Also using the Karush-Kuhn-Tucker optimization method, the minimum relative entropy of entanglement of Bell decomposable states has been evaluated and it is shown that the same separable Bell decomposable state lying at the boundary of convex set of separable Bell decomposable states, optimizes both Lewenstein-Sanpera decomposition and relative entropy of entanglement. {\bf Keywords: Minimum relative entropy of entanglement, Semi-definite programming,…
Let S_k be the set of separable states on B(C^m \otimes C^n) admitting a representation as a convex combination of k pure product states, or fewer. If m>1, n> 1, and k \le max(m,n), we show that S_k admits a subset V_k such that V_k is dense and open in S_k, and such that each state in V_k has a unique decomposition as a convex combination of pure product states, and we describe all possible convex decompositions for a set of separable states that properly contains V_k. In both cases we describe the associated faces of the space of separable states, which in the first case are simplexes, and i…
It is shown that for a given bipartite density matrix and by choosing a suitable separable set (instead of product set) on the separable-entangled boundary, optimal Lewenstein-Sanpera (L-S) decomposition can be obtained via optimization for a generic entangled density matrix. Based on this, We obtain optimal L-S decomposition for some bipartite systems such as $2\otimes 2$ and $2\otimes 3$ Bell decomposable states, generic two qubit state in Wootters basis, iso-concurrence decomposable states, states obtained from BD states via one parameter and three parameters local operations and classical …
We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a five dimensional space give rise to a face isomorphic to the 5-dimensional simplex with six vertices, under suitable linear independence assumption. If the partial conjugates of six product vectors also span a 5-dimensional space, then this face is inscribed in the face for PPT states whose boundary shares the fifteen 3-simplices on the boundary of the 5-simp…
According to usual definitions, entangled states cannot be given a separable decomposition in terms of products of local density operators. If we relax the requirement that the local density operators be positive, then an entangled quantum state may admit a separable decomposition in terms of more general sets of single-system operators. This form of separability can be used to construct classical models and simulation methods when only restricted set of measurements are available. With such motivations in mind, we ask what are the smallest such sets of local operators such that a pure biparti…
Absolutely separable states form a special subset of the set of all separable states, as they remain separable under any global unitary transformation unlike other separable states. In this work we consider the set of absolutely separable bipartite states and show that it is convex and compact in any arbitrary dimensional Hilbert space. Through a generic approach of construction of suitable hermitian operators we prove the completeness of the separation axiom for identifying any separable state that is not absolutely separable. We demonstrate the action of such witness operators in different q…
In the standard geometric approach, the entanglement of a pure state is $\sin^2θ$, where $θ$ is the angle between the entangled state and the closest separable state of products of normalised qubit states. We consider here a generalisation of this notion by considering separable states that consist of products of unnormalised states of different dimension. The distance between the target entangled state and the closest unnormalised product state can be interpreted as a measure of the entanglement of the target state. The components of the closest product state and its norm have an interpretati…
We present a new method of analytically deriving the entanglement of formation of the bipartite mixed state. The method realizes the optimal decomposition families of states. Our method can lead to many new results concerning entanglement of formation, its additivity and entanglement cost. We illustrate it by investigating the two-qubit state, the separable state, the maximally correlated state, the isotropic state and the Werner state.
We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to c…
We give a direct tensor decomposition for any density matrix into Hermitian operators. Based upon the decomposition we study when the mixed states are separable and generalize the separability indicators to multi-partite states and show that a density operator is separable if and only if the separable indicator is non-negative. We then derive two bounds for the separable indicator in terms of the spectrum of the factor operators in the tensor summands.
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in this paper, we only need one algorithm to solve the problem. We propose a tensor optimization method to check whether an $m$-partite quantum mixed state is separable or not and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Th…
A lower bound on the amount of noise that must be added to a GHZ-like entangled state to make it separable (also called the random robustness) is found using the transposition condition. The bound is applicable to arbitrary numbers of subsystems, and dimensions of Hilbert space, and is shown to be exact for qubits. The new bound is compared to previous such bounds on this quantity, and found to be stronger in all cases. It implies that increasing the number of subsystems, rather than increasing their Hilbert space dimension is a more effective way of increasing entanglement. An explicit decomp…
In 2008, the conjecture that structural physical approximations to optimal entanglement witnesses are separable states (in general unnormalized) was posed. In an attempt to disprove it, in [K.-C. Ha and S.-H. Kye, Separable states with unique decompositions, arXiv:1210.1088v3], Ha and Kye proposed a decomposable entanglement witness whose SPA is entangled and argued that it is optimal. In this note, which is based on a comment to the latter work [R. Augusiak et al., Comment on "Separable states with unique decompositions", arXiv:1304.2040v1], we show, both analytically and numerically, that th…
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.
Entangled quantum states can be given a separable decomposition if we relax the restriction that the local operators be quantum states. Motivated by the construction of classical simulations and local hidden variable models, we construct `smallest' local sets of operators that achieve this. In other words, given an arbitrary bipartite quantum state we construct convex sets of local operators that allow for a separable decomposition, but that cannot be made smaller while continuing to do so. We then consider two further variants of the problem where the local state spaces are required to contai…
Explicit separable density matrices, for mixed two qubits states, are derived by the use of Hilbert Schmidt decompositions and Peres Horodecki criterion. A strongly separable two qubits mixed state is defined by multiplications of two density matrices given with pure states while weakly separable two qubits state is defined by multiplications of two density matrices which includes non-pure states. We find the sufficient and necessary condition for separability of two-qubits density matrices and show that under this condition the two-qubit density matrices are strongly separable.
We construct faces of the convex set of all $2\otimes 4$ bipartite separable states, which are affinely isomorphic to the simplex $Δ_{9}$ with ten extreme points. Every interior point of these faces is a separable state which has a unique decomposition into 10 product states, even though ranks of the state and its partial transpose are 5 and 7, respectively. We also note that the number 10 is greater than $2\times 4$, to disprove a conjecture on the lengths of qubit-qudit separable states. This face is inscribed in the corresponding face of the convex set of all PPT states so that sub-simplice…
We develop rigorous notions of causality and causal separability in the process framework introduced in [Oreshkov, Costa, Brukner, Nat. Commun. 3, 1092 (2012)], which describes correlations between separate local experiments without a prior assumption of causal order between them. We consider the general multipartite case and take into account the possibility for dynamical causal order, where the order of a set of events can depend on other events in the past. Starting from a general definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal pro…
Separability criteria are typically of the necessary, but not sufficient, variety, in that satisfying some separability criterion, such as positivity of eigenvalues under partial transpose, does not strictly imply separability. Certifying separability amounts to proving the existence of a decomposition of a target mixed state into some convex combination of separable states; determining the existence of such a decomposition is "hard." We show that it is effective to ask, instead, if the target mixed state "fits" some preconstructed separable form, in that one can generate a sufficient separabi…
