Recently, a powerful separability criterion was introduced by O. Rudolf in [5] and by K. Chen et al. in [6] — basing on realignment of elements of density matrix. Composing the main idea behind the above criterion and the necessary and sufficient condition in terms of positive maps, we provide a characterization of separable states by means of linear contractions. The latter need not be positive maps. We extend the idea to multipartite systems, and find that, somewhat suprisingly, partial realigment (unlike partial transposition) can detect genuinely tri-parite entanglement. We generalize it by introducing a family of so called permutation separability criteria for multipartite states. Namely, any permutation of indices of density matrix written in product basis leads to a separability criterion. Partial transpose and realignment criterion are special cases of permutation criteria.
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general,
n-level systems, in terms of SU
(n) representations of density matrices. We compare the measure for the case of bipartite correlation with concurrence and the entropy of entanglement. The characterization of correlation is in terms of the number of nonzero singular values of the correlation matrix, but that of mixed state entanglement requires additional invariant parameters in the density matrix. For the bipartite qubit case, the condition for mixed state entanglement is written explicitly in terms of the invariant paramters in the density matrix. For identical particle systems we analyze the effects of exchange symmetry on classical and quantum correlation.
The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to equivalent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called combinatorial independence. This condition basically means that the map corresponding to one permutation cannot be obtained by concatenating the map corresponding to the second permutation with a norm-preserving map. We characterize completely combinatorially independent criteria, and determine simple permutations that represent all independent criteria. The representatives can be visualized by means of a simple graphical notation. They are composed of three basic operations: partial transpose, and two types of so-called reshufflings. In particular, for a four-partite system all criteria except one are composed of partial transpose and only one type of reshuffling; the exceptional one requires the second type of reshuffling. Furthermore, we show how to obtain efficiently a simple representative for every permutation. This method allows to check easily if two permutations are combinatorially equivalent or not.
For multipartite states, we consider a notion of
D symmetry. For a system of
N qubits, it coincides with the usual permutational symmetry. In the case of
N qudits ($d\ensuremath{\ge}3$), the
D symmetry is stronger than the permutational one. For the space of all
D-symmetric vectors in ${({\mathbb{C}}^{d})}^{\ensuremath{\bigotimes}N}$, we define a basis composed of vectors ${|{R}_{N,d;k}\ensuremath{\rangle}:\phantom{\rule{0.16em}{0ex}}0\ensuremath{\le}k\ensuremath{\le}N(d\ensuremath{-}1)}$ which are analogs of Dicke states. The aim of this paper is to discuss the problem of separability of
D-symmetric states which are diagonal in the basis ${|{R}_{N,d;k}\ensuremath{\rangle}}$. We show that if
N is even and $d\ensuremath{\ge}2$ is arbitrary then a positive partial transposition property is a necessary and sufficient condition of separability for
D-invariant diagonal states. In this way, we generalize results obtained by Yu [Phys. Rev. A 94, 060101(R) (2016)] and Wolfe and Yelin [Phys. Rev. Lett. 112, 140402 (2014)]. Our strategy is to use some classical mathematical results on a moment problem.
General physical background of Peres-Horodecki positive partial transpose (ppt-) separability criterion is revealed. Especially, the physical sense of partial transpose operation is shown to be equivalent to the local causality reversal (LCR-) procedure for all separable quantum systems or to the uncertainty in a global time arrow direction in all entangled cases. Using these universal causal considerations the heuristic causal separability criterion has been proposed for arbitrary $ D^{N} \times D^{N}$ density matrices acting in $ \mathcal{H}_{D}^{\otimes N} $ Hilbert spaces which describe the ensembles of $ N $ quantum systems of $ D $ eigenstates each. Resulting general formulas have been then analyzed for the widest special type of one-parametric density matrices of arbitrary dimensionality, which model equivalent quantum subsystems being equally connected (EC-) with each other by means of a single entnaglement parameter $ p $. In particular, for the family of such EC-density matrices it has been found that there exists a number of $ N $- and $ D $-dependent separability (or entanglement) thresholds $ p_{th}(N,D) $ which in the case of a qubit-pair density matrix in $ \mathcal{H}_{2} \otimes \mathcal{H}_{2} $ Hilbert space are shown to reduce to well-known results obtained earlier by Peres [5] and Horodecki [6]. As the result, a number of remarkable features of the entanglement thresholds for EC-density matrices has been described for the first time. All novel results being obtained for the family of arbitrary EC-density matrices are shown to be applicable for a wide range of both interacting and non-interacting multi-partite quantum systems, such as arrays of qubits, spin chains, ensembles of quantum oscillators, strongly correlated quantum many-body systems with the possibility of many-body localization, etc.
In the studies of quantum information and computation, the quantum correlations
present in a non-classical system are seen as natural resources. In this
thesis, we present a detailed study on quantification and characterization of
multipartite quantum entanglement from a geometric perspective. Furthermore,
we present protocols and algorithms where quantum correlations such
as entanglement, quantum Fisher information, and quantum superposition
have been used to provide advantages as well securities in quantum communication
tasks, quantum speed-up, and protection against the decoherence in
an open quantum system.
First, we use a geometric measure of entanglement quantification based
on Euclidean distance of the Hermitian matrices to obtain the minimum distance
between the set of bipartite n- qudit density matrices with a positive
partial transpose and the maximally mixed state. This minimum distance coincides
with the radius of the largest separable ball. We present the interior
geometry of the set of all positive semidefinite matrices and identify a particular
class of Werner states for which the Peres-Horodecki criterion is both
necessary and sufficient for separability even in the dimensions greater than
six.