Related papers: Characterization of combinatorially independent pe…
Starting with a set of conditions for bipartite separability of arbitrary quantum states in any dimension and expressed in terms of arbitrary operators whose commutator is a $c$-number, we derive a hierarchy of conditions for tripartite…
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 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…
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…
We discuss the entropic criterion for separability of compound quantum systems for general non-additive entropic forms based on arbitrary concave functions $f$. For any separable state, the generalized entropy of the whole system is shown…
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…
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic…
We analyse the problem of distillation of entanglement of mixed states in higher dimensional compound systems. Employing the positive maps method [M. Horodecki et al., Phys. Lett. A 223 1 (1996)] we introduce and analyse a criterion of…
We consider the problem of characterizing genuine multiparticle entanglement for permutationally invariant states using the approach of PPT mixtures. We show that the evaluation of this necessary biseparability criterion scales polynomially…
Using new combinatorial techniques, we significantly improve the previous results on asymptotic distributions and asymptotic free independence relations of partial transposes of Wishart random matrices. In particular, we give a necessary…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…
The standard method to check for the independence of two real-valued random variables -- demonstrating that the bivariate joint distribution factors into the product of its marginals -- is both necessary and sufficient. Here we present a…
The assumption of separability is a simplifying and very popular assumption in the analysis of spatio-temporal or hypersurface data structures. It is often made in situations where the covariance structure cannot be easily estimated, for…
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…
We introduce a general scheme to detect various multiparticle entanglement structures from global non-permutationally invariant observables. In particular, we derive bounds on the variance of non-permutationally invariant and collective…
This paper present a geometric diagram of a separable state: If a mixed state $\sigma $ is separable, there are $2^{nS(\sigma)}$ linearly independant product vectors which span the same Hilbert space as the $2^{nS(\sigma)}$ ``likely''…
Permutation tests are a powerful and flexible approach to inference via resampling. As computational methods become more ubiquitous in the statistics curriculum, use of permutation tests has become more tractable. At the heart of the…
The separability of bipartite non-Gaussian states is studied by applying the realignment criterion with the technique of functional analysis. The realignment criterion is given as one inequality in contrast to the infinitive number of…
A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer $k$, there is no PPT operator supporting on the orthogonal complement of $S^{\otimes k}$. We show that a…
The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the…