For a given density matrix $ρ$ of a bipartite quantum system an asymptotical separability criterion is suggested. Using the continuous ensemble method, a sequence of separable density matrices is built which converges to $ρ$ if and only if $ρ$ is separable. The convergence speed is evaluated and for any given tolerance parameter $κ$ an iterative procedure is suggested which decides in finite number of steps if there exists a separable density matrix $ρ_κ$ which differs from the matrix $ρ$ by at most $κ$.
A group of symmetric operators are introduced to carry out the separability criterion for bipartite and multipartite quantum states. Every symmetric operator, represented by a symmetric matrix with only two nonzero elements, and their arbitrary linear combinations are found to be entanglement witnesses. By using these symmetric operators, Wootters' separability criterion for two-qubit states can be generalized to bipartite and multipartite systems in arbitrary dimensions.
A new hierarchy of separability conditions for bipartite states is obtained. All the conditions in the hierarchy are necessary for separability. The conditions are expressed in terms of higher powers of the density operator of the bipartite system and the reduced density operators of the subsystems. Violation of any of the conditions in the hierarchy implies entanglement. As a consequence of the hierarchy, another separability condition, expressed in terms of the eigenvalues of the density operators of the total system and subsystems, is obtained.
For two qubits and for general bipartite quantum systems, we give a simple spectral condition in terms of the ordered eigenvalues of the density matrix which guarantees that the corresponding state is separable.
The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.
Inspired by the realignment or computable cross norm criterion, we present a new result about the characterization of quantum entanglement. Precisely, an interesting class of inequalities satisfied by all separable states of a bipartite quantum system is derived. These inequalities induce new separability criteria that generalize the realignment criterion.
The conditional version of sandwiched Tsallis relative entropy (CSTRE) is employed to study the bipartite separability of one parameter family of N-qudit Werner- Popescu states in their 1 : N-1 partition. For all N, the strongest limitation on bipartite separability is realized in the limit q tending to infinity and is found to match exactly with the separability range obtained using an algebraic method which is both necessary and sufficient. The theoretical superiority of using CSTRE criterion to find the bipartite separability range over the one using Abe- Rajagopal (AR) q-conditional entrop…
In this paper, we present the necessary and sufficient conditions of separability for bipartite pure states in infinite dimensional Hilbert spaces. Let $M$ be the matrix of the amplitudes of $\ketψ$, we prove $M$ is a compact operator. We also prove $\ketψ$ is separable if and only if $M$ is a bounded linear operator with rank 1, that is the image of $M$ is a one dimensional Hilbert space. So we have related the separability for bipartite pure states in infinite dimensional Hilbert spaces to an important class of bounded linear operators in Functional analysis which has many interesting proper…
We provide a necessary and sufficient condition for separability of Gaussian states of bipartite systems of arbitrarily many modes. The condition provides an operational criterion since it can be checked by simple computation. Moreover, it allows us to find a pure product-state decomposition of any given separable Gaussian state. Our criterion is independent of the one based on partial transposition, and is strictly stronger.
We introduce algebraic sets in the complex projective spaces for the mixed states in bipartite quantum systems as their invariants under local unitary operations. The algebraic sets of the mixed state have to be the union of the linear subspaces if the mixed state is separable. Some examples are given and studied based on our criterion
We construct a density matrix whose elements are written in terms of expectation values of non-Hermitian operators and their products for arbitrary dimensional bipartite states. We then show that any expression which involves matrix elements can be reformulated by the expectation values of these non-Hermitian operators and vice versa. We consider the condition of pure states and pure product states and rewrite them in terms of expectation values and density matrix elements respectively. We utilize expectation values of these operators to present the condition for separability of ${C}^d \otimes…
A decomposition form is introduced in this report to establish a criterion for the bi-partite separability of Bell diagonal states. A such criterion takes a quadratic form of the coefficients of a given Bell diagonal states and can be derived via a simple algorithmic calculation of its invariants. In addition, the criterion can be extended to a quantum system of higher dimension.
A new criterion necessary and sufficient for the separability of pure bipartite systems for arbitrary finite dimensions is demonstrated; and the corresponding finer quantitative measures or characterizations of entanglement (beyond mere separability or non-separability determination) are discussed. Based on this criterion, we proved that the well-known Peres-Horodecki positivity-of-partial-transform criterion is also necessary and sufficient for separability in the case of pure bipartite systems. The maximum value of entanglement, and the corresponding maximally-entangled states are also worke…
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…
The problem on detecting the entanglement of a bipartite state is significant in quantum information theory. In this article, we apply the Ky Fan norm to the revised realignment matrix of a bipartite state. Specifially, we consider a family of separable criteria for bipartite states, and present when the density matrix corresponds to a state is real, the criteria is equivalent to the enhanced realignment criterion. Moreover, we present analytical lower bounds of concurrence and the convex-roof extended negativity for arbitrary dimensional systems.
The Peres-Horodecki criterion of positivity under partial transpose is studied in the context of separability of bipartite continuous variable states. The partial transpose operation admits, in the continuous case, a geometric interpretation as mirror reflection in phase space. This recognition leads to uncertainty principles, stronger than the traditional ones, to be obeyed by all separable states. For all bipartite Gaussian states, the Peres-Horodecki criterion turns out to be necessary and sufficient condition for separability.
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several inmediate consequences are analyzed: (i) a sufficient criterion for separability for bipartite quantum systems, (ii) a complete solution to the separability problem for pure states also of bipartite systems independent of the classical Schmidt decomposition method and (iii) a natural generalization of these results to multipartite systems.
Usual separability criteria applicable to distinguishable particles are not applicable to identical particles. Here we show that Partial transposition and symmetrization (or anti symmetrization) of density matrix of bipartite boson systems (fermion systems) can be used to check whether a state is separable or not.By using determinant based separability criteria it has been found that bipartite states of identical particles are always separable. It is found that partial transposition and symmetrization is equivalent to realignment criteria proposed by Wu.
We study the separability of symmetric bipartite quantum states and show that a single correlation measurement is sufficient to detect the entanglement of any bipartite symmetric state with a non-positive partial transpose. We also discuss entanglement conditions and entanglement witnesses for states with a positive partial transpose.
Bipartite separability of one parameter families of states using conditional quantum relative Tsallis entropy
Kuvempu University（库韦姆普大学）；Inspire Institute Inc.（Inspire研究所）；Harish-Chandra Research Institute（哈里什-钱德拉研究所）；Institute of Mathematical Sciences（数学科学研究所）；Bangalore University（班加罗尔大学）
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble method, to a finite number of numerical equations. The solution of this system exists for any robustly separable density operator and provides its representation by a continuous mixture of pure product states.
By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $ρ$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the computable cross norm or realignment (CCNR) criterion. With linear contraction methods, the proposed criteria can be used to detect the multipartite entangled states that are biseparable under any bipartite partitions. Moreover, we show by examples that the presented multipartite separability criteria can be more efficient than the corresponding multipartite real…
We present three necessary separability criteria for bipartite mixed states, the violation of each of these conditions is a sufficient condition for entanglement. Some ideas on the issue of finding a necessary and sufficient criterion of separability are also discussed.
P-representability is a necessary and sufficient condition for separability of bipartite Gaussian states only for the special subset of states whose covariance matrix are $Sp(2,R)\otimes Sp(2,R)$ locally invariant. Although this special class of states can be reached by a convenient $Sp(2,R)\otimes Sp(2,R)$ transformation over an arbitrary covariance matrix, it represents a loss of generality, avoiding inference of many general aspects of separability of bipartite Gaussian states.
We derive a collection of separability conditions for bipartite systems of dimensions d X d which is based on the entropic version of the uncertainty relations. A detailed analysis of the two-qubit case is given by comparing the new separability conditions with existing criteria.
Many protocols of quantum information processing use entangled states. Hence, separability criteria are of great importance. We propose new separability conditions for a bipartite finite-dimensional system. They are derived by using fine-grained uncertainty relations. Fine-grained uncertainty relations can be obtained by consideration of the spectral norms of certain positive matrices. One of possible approaches to separability conditions is connected with upper bounds on the sum of maximal probabilities. Separability conditions are often formulated for measurements that have a special structu…
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 {\it et. al.} and uses the Bloch vector representation introduced to the separability problem by J. De Vicente. In our criterion, …
We consider entanglement detection for quantum key distribution systems that use two signal states and continuous variable measurements. This problem can be formulated as a separability problem in a qubit-mode system. To verify entanglement, we introduce an object that combines the covariance matrix of the mode with the density matrix of the qubit. We derive necessary separability criteria for this scenario. These criteria can be readily evaluated using semidefinite programming and we apply them to the specific quantum key distribution protocol.
We first propose a new separability criterion based on algebraic-geometric invariants of bipartite mixed states introduced in [1], then prove that for all low ranks r <m+n-2, generic rank r mixed states in mxn systems have relatively high Schmidt numbers (thus entangled) by this separability criterion. This also means that the algebraic-geometric separability criterion proposed here can be used to dectect all low rank entangled mixed states outside a measure zero set.
We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified according to their capability to perform some precisely defined tasks.
We study the normal form of multipartite density matrices. It is shown that the correlation matrix (CM) separability criterion can be improved from the normal form we obtained under filtering transformations. Based on CM criterion the entanglement witness is further constructed in terms of local orthogonal observables for both bipartite and multipartite systems.
Separability is an important problem in theory of quantum entanglement. By using the Bloch representation of quantum states in terms of the Heisenberg-Weyl observable basis, we present a new separability criterion for bipartite quantum systems. It is shown that this criterion can be better than the previous ones in detecting entanglement. The results are generalized to multipartite quantum states.
We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our criteria are more powerful than the positive partial transposition criterion, the realignment criterion and the criteria based on the correlation matrices.
This short note describes a method to tackle the (bipartite) quantum separability problem. The method can be used for solving the separability problem in an experimental setting as well as in the purely mathematical setting. The idea is to invoke the following characterization of entangled states: A state is entangled if and only if there exists an entanglement witness that detects it. The method is basically a search for an entanglement witness that detects the given state.
We derive a separability criterion for bipartite quantum systems which generalizes the already known criteria. It is based on observables having generic commutation relations. We then discuss in detail the relation among these criteria.
The correlation matrices or tensors in the Bloch representation of density matrices are encoded with entanglement properties. In this paper, based on the Bloch representation of density matrices, we give some new separability criteria for bipartite and multipartite quantum states. Theoretical analysis and some examples show that the proposed criteria can be more efficient than the previous related criteria.
We obtain a collection of necessary (sufficient) conditions for a bipartite system of qubits to be separable (entangled), which are based on the Landau-Pollak formulation of the uncertainty principle. These conditions are tested, and compared with previously stated criteria, by applying them to states whose separability limits are already known. Our results are also extended to multipartite and higher-dimensional systems.
We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as Robust Semidefinite Programs (RSDP). We propose, using well known properties of RSDP, several new sufficient tests for the separability of mixed states. Our results are then generalized to multipartite density operators.
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable …
Our previous work about algebraic-geometric invariants of the mixed states are extended and a stronger separability criterion is given. We also show that the Schmidt number of pure states in bipartite quantum systems, a classical concept, is actually an algebraic-geometric invariant.
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is the quantum separability problem. Chapters 1 to 3 motivate a new interior-point 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. When all the expected values are known, the algorithm solves the sepa…
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.
In this paper, we discuss the partial separability and its criteria problems of multipartite qubit mixed-states. First we strictly define what is the partial separability of a multipartite qubit system. Next we give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit mixed-state to be partially separable is its reduction to satisfy the PPT condition. PACC numbers: 03.67.Mn; 03.65.Ud; 03.67.Hk
We present a method for checking Peres separability criterion in an arbitrary bipartite quantum state $ρ_{AB}$ within local operations and classical communication scenario. The method does not require the prior state reconstruction and the structural physical approximation. The main task for the two observers, Alice and Bob, is to estimate some specific functions. After getting these functions, they can determine the minimal eigenvalue of $ρ^{T_{B}}_{AB}$, which serves as an entanglement indicator in lower dimensions.
Motivated by the notions of $k$-extendability and complete extendability of the state of a finite level quantum system as described by Doherty et al (Phys. Rev. A, 69:022308), we introduce parallel definitions in the context of Gaussian states and using only properties of their covariance matrices derive necessary and sufficient conditions for their complete extendability. It turns out that the complete extendability property is equivalent to the separability property of a bipartite Gaussian state. Following the proof of quantum de Finetti theorem as outlined in Hudson and Moody (Z. Wahrschein…
Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs) and general symmetric informationally complete (GSIC) measurements, respectively, that are both not necessarily rank 1. We study the quantum separability problem by using these measurements and present separability criteria for bipartite systems with arbitrary dimensions and multipartite systems of multi-level subsystems. These criteria are proved to be more e…
We study the quantum separability problem by using general symmetric informationally complete measurements and present separability criteria for both $d$-dimensional bipartite and multipartite systems. The criterion for bipartite quantum states are effective in detecting several well known classes of quantum states. For isotropic states, it becomes both necessary and sufficient. Furthermore, our criteria can be experimentally implemented and the criterion for two-qudit states requires less local measurements than the one based on mutually unbiased measurements.
The separability from spectrum problem asks for a characterization of the eigenvalues of the bipartite mixed states ρ with the property that U^*ρU is separable for all unitary matrices U. This problem has been solved when the local dimensions m and n satisfy m = 2 and n <= 3. We solve all remaining qubit-qudit cases (i.e., when m = 2 and n >= 4 is arbitrary). In all of these cases we show that a state is separable from spectrum if and only if U^*ρU has positive partial transpose for all unitary matrices U. This equivalence is in stark contrast with the usual separability problem, where a state…
We study bipartite entanglement in systems of N identical bosons distributed in M different modes. For such systems, a definition of separability not related to any a priori Hilbert space tensor product structure is needed and can be given in terms of commuting subalgebras of observables. Using this generalized notion of separability, we classify the states for which partial transposition turns out to be a necessary and sufficient condition for entanglement detection.
A geometric understanding of entanglement is proposed based on local measurements. Taking recourse to the general structure of density matrices in the framework of Euclidean geometry, we first illustrate our approach for bipartite Werner states. It is demonstrated that separable states satisfy certain geometric constraints that entangled states do not. A separability criterion for multiparty Werner states of arbitrary dimension is derived. This approach can be used to determine separability across any bipartition of a general density matrix and leads naturally to a computable measure of entang…
We analyze and compare the mathematical formulations of the criterion for separability for bipartite density matrices and the Bell inequalities. We show that a violation of a Bell inequality can formally be expressed as a witness for entanglement. We also show how the criterion for separability and a description of the state by a local hidden variable theory, become equivalent when we restrict the set of local hidden variable theories to the domain of quantum mechanics. This analysis sheds light on the essential difference between the two criteria and may help us in understanding whether there…
Linear and nonlinear entanglement witnesses for a given bipartite quantum systems are constructed. Using single particle feasible region, a way of constructing effective entanglement witnesses for bipartite systems is provided by exact convex optimization. Examples for some well known two qutrit quantum systems show these entanglement witnesses in most cases, provide necessary and sufficient conditions for separability of given bipartite system. Also this method is applied to a class of bipartite qudit quantum systems with details for d=3, 4 and 5. Keywords: non-linear and linear entanglement …
For a quantum state in a bipartite system represented as a density matrix, researchers used the realignment matrix and functions on its singular values to study the separability of the quantum state. We obtain bounds for elementary symmetric functions of singular values of realignment matrices. This answers some open problems proposed by Lupo, Aniello, and Scardicchio. As a consequence, we show that the proposed scheme by these authors for testing separability would not work if the two subsystems of the bipartite system have the same dimension.
