Related papers: On independent permutation separability criteria

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)…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

We present a new set of inseparabilty inequalities to detect entanglement in $N$-spin states. These are based on negative partial transposition and involve collective spin-spin correlations of any two partitions of the entire system. They…

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…

We derive a family of necessary separability criteria for finite-dimensional systems based on inequalities for variances of observables. We show that every pure bipartite entangled state violates some of these inequalities. Furthermore, a…

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which…

Let $G$ be a finite group. In 2024, Cameron introduced two different concepts of independence (namely independence and strong independence) for the subsets of $G$, yielding to the definition of two simplicial complexes whose vertices are…

We establish the independence of multipliers for polynomial endomorphisms of $\mathbb C^n$ and endomorphisms of $\mathbb P^n.$ This allows us to extend results about the bifurcation measure and the critical height obtained in…

A quantum system consisting of two subsystems is separable if its density matrix can be written as $\rho=\sum_A w_A\,\rho_A'\otimes\rho_A''$, where $\rho_A'$ and $\rho_A''$ are density matrices for the two subsytems. In this Letter, it is…

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 develop separability criteria to identify non-$k$-separability $(k = 2,3,\ldots,n)$ and genuine multipartite entanglement in different classes of mixed $n$-partite quantum states using elements of density matrices. With the help of these…

We provide necessary and sufficient conditions for separability of mixed states of n-particle systems. The conditions are formulated in terms of maps which are positive on product states of $n-1$ particles. The method of providing of the…

We investigate the sample complexity of mutual information and conditional mutual information testing. For conditional mutual information testing, given access to independent samples of a triple of random variables $(A, B, C)$ with unknown…

We study a class of determinantal ideals that are related to conditional independence (CI) statements with hidden variables. Such CI statements correspond to determinantal conditions on a matrix whose entries are probabilities of events…

We show how to decompose any density matrix of the simplest binary composite systems, whether separable or not, in terms of only product vectors. We determine for all cases the minimal number of product vectors needed for such a…

We show that the stochastic independence of real-valued random variables is equivalent to the conditional uncorrelation, where the conditioning takes place over the Cartesian products of intervals. Next, we express the mutual independence…

We propose a new class of models for random permutations, which we call log-linear models, by the analogy with log-linear models used in the analysis of contingency tables. As a special case, we study the family of all Luce-decomposable…

A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

After introducing the partially separable concept, we proved the equivalence between the partial separability of a given $m$-partite subsystem with $m$ qubits and the purity of states of this $m$-partite subsystem for a pure state in…