We investigate the canonical forms of positive partial transposition (PPT) density matrices in ${\cal C}^2 \otimes {\cal C}^M \otimes {\cal C}^N$ composite quantum systems with rank $N$. A general expression for these PPT states are explicitly obtained. From this canonical form a sufficient separability condition is presented.
By using the "subtracting projectors" method in proving the separability of PPT states on multiple quantum spaces, we derive a canonical form of PPT states in ${\Cb}^{K_1} \otimes {\Cb}^{K_2} \otimes ... \otimes {\Cb}^{K_m} \otimes {\Cb}^N$ composite quantum systems with rank $N$, from which a sufficient separability condition for these states is presented.
We give a canonical form of PPT states in ${\cal C}^2 \otimes {\cal C}^2\otimes {\cal C}^2 \otimes {\cal C}^N$ with rank=$N$. From this canonical form a necessary separable condition for these states is presented.
We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS in $C^d\otimes C^d$ (symmetric qudits) can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT) is sufficien…
Positivity of the density operator reflects itself in terms of sequences of inequalities on observable moments. Uncertainty relations for non-commuting observables form a subset of these inequalities. In addition, criterion of positivity under partial transposition (PPT) imposes distinct bounds on moments, violations of which signal entanglement. We present bounds on some novel sets of composite moments, consequent to positive partial transposition of the density operator and report their violation by entangled multiqubit states. In particular, we derive separability bounds on a multiqubit mom…
We investigate the separability of the two-mode Gaussian states by using the variances of a pair of Einstein-Podolsky-Rosen (EPR)-like observables. Our starting point is inspired by the general necessary condition of separability introduced by Duan {\em et al.} [Phys. Rev. Lett. {\bf 84}, 2722 (2000)]. We evaluate the minima of the normalized forms of both the product and sum of such variances, as well as that of a regularized sum. Making use of Simon's separability criterion, which is based on the condition of positivity of the partial transpose (PPT) of the density matrix [Phys. Rev. Lett. {…
We study quantum states for which the PPT criterion is both sufficient and necessary for separability. We present a class of 3x3 bipartite mixed states and show that these states are separable if and only if they are PPT.
We study the general representations of positive partial transpose (PPT) states in ${\cal C}^K \otimes {\cal C}^M \otimes {\cal C}^N$. For the PPT states with rank-$N$ a canonical form is obtained, from which a sufficient separability condition is presented.
In a series of papers with Kossakowski, the first author has examined properties of densities for which the positive partial transpositrionm (PPT) property can be readily checked. These densities were also investigated from a different perspective by Baumgartner, Hiesmayr and Narnhofer. In this paper we show how the support of such densities can be expressed in terms of lines in a finite geometry and how that same structure lends itself to checking the necessary PPT condition and to a novel sufficient condition for separability.
We report here on the results of numerical searches for PPT states with specified ranks for density matrices and their partial transpose. The study includes several bipartite quantum systems of low dimensions. For a series of ranks extremal PPT states are found. The results are listed in tables and charted in diagrams. Comparison of the results for systems of different dimensions reveal several regularities. We discuss lower and upper bounds on the ranks of extremal PPT states.
We consider low rank density operators $\varrho$ supported on a $M\times N$ Hilbert space for arbitrary $M$ and $N$ ($M\leq N$) and with a positive partial transpose (PPT) $\varrho^{T_A}\ge 0$. For rank $r(\varrho) \leq N$ we prove that having a PPT is necessary and sufficient for $\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 th…
We investigate the separability of arbitrary $n$-dimensional multipartite identical bosonic systems. An explicit relation between the dimension and the separability is presented. In particular, for $n=3$, it is shown that the property of PPT (positive partial transpose) and the separability are equivalent for tripartite systems.
With a probability of success of $95 \%$ we solve the separability problem for Bell diagonal qutrit states with positive partial transposition (PPT). The separability problem, i.e. distinguishing separable and entangled states, generally lacks an efficient solution due to the existence of bound entangled states. In contrast to free entangled states that can be used for entanglement distillation via local operations and classical communication, these states cannot be detected by the Peres-Horodecki criterion or PPT criterion. We analyze a large family of bipartite qutrit states that can be sepa…
The computable cross norm (CCN) criterion is a new powerful analytical and computable separability criterion for bipartite quantum states, that is also known to systematically detect bound entanglement. In certain aspects this criterion complements the well-known Peres positive partial transpose (PPT) criterion. In the present paper we study important analytical properties of the CCN criterion. We show that in contrast to the PPT criterion it is not sufficient in dimension 2 x 2. In higher dimensions we prove theorems connecting the fidelity of a quantum state with the CCN criterion. We also a…
Jakobczyk and Siennicki studied two-dimensional sections of a set of (generalized) Bloch vectors corresponding to n x n density matrices of two-qubit systems (that is, the case n = 4). They found essentially five different types of (nontrivial) separability regimes. We compute the Euclidean/Hilbert-Schmidt (HS) separability probabilities assigned to these regimes, and conduct parallel two-dimensional sectional analyses for the higher-level cases n=6,8,9 and 10. Making use of the newly-introduced capability for integration over implicitly defined regions of version 5.1 of Mathematica -- also fr…
We present a novel approach to the separability problem for Gaussian quantum states of bosonic continuous variable systems. We derive a simplified necessary and sufficient separability criterion for arbitrary Gaussian states of $m$ vs $n$ modes, which relies on convex optimisation over marginal covariance matrices on one subsystem only. We further revisit the currently known results stating the equivalence between separability and positive partial transposition (PPT) for specific classes of Gaussian states. Using matrix analysis techniques such as Schur complements and matrix means, we provide…
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.
We conduct quasi-Monte Carlo numerical integrations in two very high (80 and 79)-dimensional domains -- the parameter spaces of rank-9 and rank-8 qutrit-qutrit (9 x 9) density matrices. We, then, estimate the ratio of the probability -- in terms of the Hilbert-Schmidt metric -- that a generic rank-9 density matrix has a positive partial transpose (PPT) to the probability that a generic rank-8 density matrix has a PPT (a precondition to separability/nonentanglement). Close examination of the numerical results generated -- despite certain large fluctuations -- indicates that the true ratio may, …
Detection power of separability criteria based on a correlation tensor is tested within a family of generalized isotropic state in $d_1 \otimes d_2$. For $d_1 \neq d_2$ all these criteria are weaker than positive partial transposition (PPT) criterion. Interestingly, our analysis supports the recent conjecture that a criterion based on symmetrically informationaly complete positive operator-valued measure (SIC-POVMs) is stronger than realignment criterion.
In this paper, we present new progress on the study of the symmetric extension criterion for separability. First, we show that a perturbation of order O(1/N) is sufficient and, in general, necessary to destroy the entanglement of any state admitting an N Bose symmetric extension. On the other hand, the minimum amount of local noise necessary to induce separability on states arising from N Bose symmetric extensions with Positive Partial Transpose (PPT) decreases at least as fast as O(1/N^2). From these results, we derive upper bounds on the time and space complexity of the weak membership probl…
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 generalize the definition of strong positive partial transpose (SPPT) to the multipartite system. The tripartite case was first considered by X.-Y. Yu and H. Zhao [ Int. J. Theor. Phys.,54, 292, (2015)]. In this extension, unfortunately, desired properties such as the PPT of SPPT states the separability of super and pure SPPT states are not preserved. In contrast, this paper provides an alternative generalization to multipartite cases with these properties preserved. We also provide sufficient conditions for the separability of SPPT states.
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
Entanglement as a vital resource for information processing can be described by special properties of the quantum state. Using the well-known Weyl basis we propose a new Bloch decomposition of the quantum state and study its separability problem. This decomposition enables us to find an alternative characterization of the separability based on the correlation matrix. We shaw that the criterion is effective in detecting entanglement for the isotropic states, Bell-diagonal states and some PPT entangled states. We also use the Weyl operators to construct an detecting operator for quantum teleport…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of entanglement.
We solve the open question of the existence of four-qubit entangled symmetric states with positive partial transpositions (PPT states). We reach this goal with two different approaches. First, we propose a half-analytical-half-numerical method that allows to construct multipartite PPT entangled symmetric states (PPTESS) from the qubit-qudit PPT entangled states. Second, we adapt the algorithm allowing to search for extremal elements in the convex set of bipartite PPT states [J. M. Leinaas, J. Myrheim, and E. Ovrum, Phys. Rev. A 76, 034304 (2007)] to the multipartite scenario. With its aid we s…
One of the most important problems in quantum information is the separability problem, which asks whether a given quantum state is separable. We investigate multipartite states of rank at most four which are PPT (i.e., all their partial transposes are positive semidefinite). We show that any PPT state of rank two or three is separable and has length at most four. For separable states of rank four, we show that they have length at most six. It is six only for some qubit-qutrit or multiqubit states. It turns out that any PPT entangled state of rank four is necessarily supported on a 3x3 or a 2x2…
The separability and entanglement of quantum mixed states in $\Cb^2 \otimes \Cb^3 \otimes \Cb^N$ composite quantum systems are investigated. It is shown that all quantum states $ρ$ with positive partial transposes and rank $r(ρ)\leq N$ are separable.
We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability condition for general density operators in such quantum systems. We also give a simple proof of the separability criterion in $2\times 2$--dimensional systems [A. Peres, Phys. Rev. Lett {\bf 77}, 1413 (1996)]
Milz and Strunz ({\it J. Phys. A}: {\bf{48}} [2015] 035306) recently studied the probabilities that two-qubit and qubit-qutrit states, randomly generated with respect to Hilbert-Schmidt (Euclidean/flat) measure, are separable. They concluded that in both cases, the separability probabilities (apparently exactly $\frac{8}{33}$ in the two-qubit scenario) hold {\it constant} over the Bloch radii ($r$) of the single-qubit subsystems, jumping to 1 at the pure state boundaries ($r=1$). Here, firstly, we present evidence that in the qubit-qutrit case, the separability probability is uniformly distrib…
We employ a quasirandom methodology, recently developed by Martin Roberts, to estimate the separability probabilities, with respect to the Bures (minimal monotone/statistical distinguishability) measure, of generic two-qubit and two-rebit states. This procedure, based on generalized properties of the golden ratio, yielded, in the course of almost seventeen billion iterations (recorded at intervals of five million), two-qubit estimates repeatedly close to nine decimal places to $\frac{25}{341} =\frac{5^2}{11 \cdot 31} \approx 0.073313783$. Howeer, despite the use of over twenty-three billion it…
An important variable in the 2017 analysis of Lovas and Andai, formally establishing the Hilbert-Schmidt separability probability conjectured by Slater of $\frac{29}{64}$ for the 9-dimensional convex set of two-rebit density matrices, was the ratio ($\varepsilon =\frac{σ_2}{σ_1}$) of the two singular values ($σ_1 \geq σ_2 \geq 0$) of $D_2^{\frac{1}{2}} D_1^{-\frac{1}{2}}$. There, $D_1$ and $D_2$ were the diagonal $2 \times 2$ blocks of a $4 \times 4$ two-rebit density matrix $ρ$. Working within the Lovas-Andai "separability function" ($\tildeχ_d(\varepsilon)$) framework, Slater was able to ver…
We begin by seeking the qubit-qutrit and rebit-retrit counterparts to the now well-established Hilbert-Schmidt separability probabilities for (the 15-dimensional convex set of) two-qubits of $\frac{8}{33} = \frac{2^3}{3 \cdot 11} \approx 0.242424$ and (the 9-dimensional) two-rebits of $\frac{29}{64} =\frac{29}{2^6} \approx 0.453125$. Based in part on extensive numerical computations, we advance the possibilities of a qubit-qutrit value of $\frac{27}{1000} = (\frac{3}{10})^3 =\frac{3^3}{2^3 \cdot 5^3} = 0.027$ and a rebit-retrit one of $\frac{860}{6561} =\frac{2^2 \cdot 5 \cdot 43}{3^8} \approx…
Sparse positive maps on qutrits with exact nondecomposability thresholds and PPT-entanglement transitions
Università degli Studi di Pavia(帕维亚大学);INFN Sezione di Pavia(意大利国家核物理研究所帕维亚分部);Università di Trieste(的里雅斯特大学);INFN Sezione di Trieste(意大利国家核物理研究所的里雅斯特分部);MIT(麻省理工学院);CNR-Istituto di Fotonica e Nanotecnologie(国家研究委员会光子学与纳米技术研究所)
We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For the 3 qubit case (N=2) we prove that all states $ρ$ that have positive partial transposes and rank 3 are separable. We provide also constructive separability checks for the states $ρ$ that have the sum of the rank of $ρ$ and the ranks of partial transposes with respect to all subsystems smaller than 15N-1.
We construct a family of bipartite states of arbitrary dimension whose eigenvalues of the partially transposed matrix can be inferred directly from the block structure of the global density matrix. We identify from this several subfamilies in which the PPT criterion is both necessary and sufficient. A sufficient criterion of separability is obtained, which is fundamental for the discussion. We show how several examples of states known to be classifiable by the PPT criterion indeed belong to this general set. Possible uses of these states in numerical analysis of entanglement and in the search …
For any unitarily invariant convex function F on the states of a composite quantum system which isolates the trace there is a critical constant C such that F(w)<= C for a state w implies that w is not entangled; and for any possible D > C there are entangled states v with F(v)=D. Upper- and lower bounds on C are given. The critical values of some F's for qubit/qubit and qubit/qutrit bipartite systems are computed. Simple conditions on the spectrum of a state guaranteeing separability are obtained. It is shown that the thermal equilbrium states specified by any Hamiltonian of an arbitrary compo…
We analyze the separability properties of density operators supported on $\C^2\otimes \C^N$ whose partial transposes are positive operators. We show that if the rank of $ρ$ equals N then it is separable, and that bound entangled states have rank larger than N. We also give a separability criterion for a generic density operator such that the sum of its rank and the one of its partial transpose does not exceed 3N. If it exceeds this number we show that one can subtract product vectors until decreasing it to 3N, while keeping the positivity of $ρ$ and its partial transpose. This automatically gi…
This work is an enquiry into the circumstances under which entropy methods can give an answer to the questions of both quantum separability and classical correlations of a composite state. Several entropy functionals are employed to examine the entanglement and correlation properties guided by the corresponding calculations of concurrence. It is shown that the entropy difference between that of the composite and its marginal density matrices may be of arbitrary sign except under special circumstances when conditional probability can be defined appropriately. This ambiguity is a consequence of …
We give a new separability criterion, a necessary condition for separability of $N$-partite quantum states. The criterion is based on the Bloch representation of a $N$-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to {\it arbitrary} $N$-partite quantum states in $\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes ... \otimes \mathcal{H}^{d_N}.$ The criterion can test whether a $N$-partite state is entangled and can be applied to different partitions of the $N$-partite system. We provide examples that sho…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglem…
We investigate the Peres-Horodecki positive partial transpose (PPT) criterion in the context of conserved quantities and derive a condition of in- separability for a composite bipartite system depending only on the dimen- sions of its subsystems, which leads to a bi-linear entanglement witness for the two qubit system. A separability inequality using generalized Schrodinger- Robertson uncertainty relation taking suitable operators, has been derived, which proves to be stronger than the bi-linear entanglement witness operator. In the case of mixed density matrices, it identically distinguishes …
A geometrical picture of separability of 2 x 2 composite quantum systems, showing the region of separable density matrices in the space of hermitian matrices, is given. It rests on the criterion of separability given by Peres, and it is an extension of the ``Horodecki diagram'' and the ``stella octangula'' described by Aravind.
We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability criteria, and improves the lower bounds such as from the PPT, realignment criteria and the Breuer's entanglement witness.
We revisit the relationship between quantum separability and the sign of the relative q-entropies of composite quantum systems. The q-entropies depend on the density matrix eigenvalues p_i through the quantity omega_q = sum_i p_i^q. Renyi's and Tsallis' measures constitute particular instances of these entropies. We perform a systematic numerical survey of the space of mixed states of two-qubit systems in order to determine, as a function of the degree of mixture, and for different values of the entropic parameter q, the volume in state space occupied by those states characterized by positive …
Quantum mechanics is already 100 years old, but remains alive and full of challenging open problems. On one hand, the problems encountered at the frontiers of modern theoretical physics like Quantum Gravity, String Theories, etc. concern Quantum Theory, and are at the same time related to open problems of modern mathematics. But even within non-relativistic quantum mechanics itself there are fundamental unresolved problems that can be formulated in elementary terms. These problems are also related to challenging open questions of modern mathematics; linear algebra and functional analysis in pa…
We address an open question about the existence of entangled continuous-variable (CV) Werner states with positive partial transpose (PPT). We prove that no such state exists by showing that all PPT CV Werner states are separable. The separability follows by observing that these CV Werner states can be approximated by truncating the states into a finite-dimensional convex mixture of product states. In addition, the constituents of the product states comprise a generalized non-Gaussian measurement which gives, rather surprisingly, a strictly tighter upper bound on quantum discord than photon cou…
It is known that he bipartite quantum states, with rank strictly smaller than the maximum of the ranks of its two reduced states, are distillable by local operations and classical communication. Our first main result is that this is also true for NPT states with rank equal to this maximum. (A state is PPT if the partial transpose of its density matrix is positive semidefinite, and otherwise it is NPT.) This was conjectured first in 1999 in the special case when the two local ranks are equal. Our second main result provides a complete solution of the separability problem for bipartite states of…
We propose separability criteria for three-qubit states in terms of diagonal and anti-diagonal entries to detect entanglement with positive partial transposes. We report that the phases, that is, the angular parts of anti-diagonal entries, play a crucial role in determining whether a given three-qubit state is separable or entangled, and they must obey even an identity for separability in some cases. These criteria are strong enough to detect PPT (positive partial transpose) entanglement with nonzero volume. In several cases when all the entries are zero except for diagonal and anti-diagonal e…
Recently, in [1], the author proved that many results that are true for PPT matrices also hold for another class of matrices with a certain symmetry in their Hermitian Schmidt decompositions. These matrices were called SPC in [1] (definition 1.1). Before that, in [9], Tóth and Gühne proved that if a state is symmetric then it is PPT if and only if it is SPC. A natural question appeared: What is the connection between SPC matrices and PPT matrices? Is every SPC matrix PPT? Here we show that every SPC matrix is PPT in $M_2\otimes M_2$ (theorem 4.3). This theorem is a consequence of the fact that…
We construct a parameterized family of $n\otimes n$ PPT (positive partial transpose) states of corank one for each $n\ge 3$. With a suitable choice of parameters, we show that they are $n\otimes n$ PPT entangled edge states of corank one for $3\le n\le 1000$. They violate the range criterion for separability in the most extreme way. Note that corank one is the smallest possible corank for such states. The corank of the partial transpose is given by $2n-3$, which is also the smallest possible corank for the partial transposes of PPT entangled edge states of corank one. They provide the first ex…
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 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…
Within the decoherence theory we investigate the physical background of the condition of the separability (diagonalizability in noncorrelated basis) of the interaction Hamiltonian of the composite system, "system plus environment". It proves that the condition of the separability may serve as a criterion for defining "system", but so that "system" cannot be defined unless it is simultaneously defined with its "environment". When extended to a set of the mutually interacting composite systems, this result implies that the separability conditions of the local interactions are mutually tied. The …
We express the positive partial transpose (PPT) separability criterion for symmetric states of multi-qubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental inte…