Related papers: X-matrices provide a lower bound of concurrence

It is a hard and important problem to find the criterion of the set of positive-definite matrixes which can be written as reduced density operators of a multi-partite quantum state. This problem is closely related to the study of many-body…

In this paper, we present a measure of multipartite entanglement ($k$-nonseparable), $k$-ME concurrence $C_{k-\mathrm{ME}}(\rho)$ that unambiguously detects all $k$-nonseparable states in arbitrary dimensions, where the special case, 2-ME…

In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz…

Quantities invariant under local unitary transformations are of natural interest in the study of entanglement. This paper deduces and studies a particularly simple quantity that is constructed from a combination of two standard permutations…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

The difference of quantum mutual information for bipartite system of qubits and minimum taken with respect to local unitary transformation group is introduced as a characteristic of quantum correlations.The two qubits example (and…

For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are…

Let X be a singular affine normal variety with coordinate ring R and assume that there is an R-order admitting a stability structure such that the scheme of relevant semistable representations is smooth, then we construct a partial…

The bounds on concurrence of the superposition state in terms of those of the states being superposed are studied in this paper. The bounds on concurrence are quite different from those on the entanglement measure based on von Neumann…

Uncertainty lower bounds for parameter estimations associated with a unitary family of mixed-state density matrices are obtained by embedding the space of density matrices in the Hilbert space of square-root density matrices. In the…

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…

We consider the problem of distinguishing between two arbitrary black-box distributions defined over the domain [n], given access to $s$ samples from both. It is known that in the worst case O(n^{2/3}) samples is both necessary and…

Entanglement and steering are used to describe quantum inseparabilities. Steerable states form a strict subset of entangled states. A natural question arises concerning how much territory steerability occupies entanglement for a general…

Explicit separability of general two qubits density matrices is related to Lorentz transformations. We use the 4-dimensional form R(u,v=0,1,2,3) of the Hilbert-Schmidt (HS) decomposition of the density matrix. For the generic case in which…

The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…

We study geometrical aspects of entanglement, with the Hilbert--Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a ``relativistic'' formulation leads…

For finite-dimensional bipartite quantum systems, we find the exact size of the largest balls, in spectral $l_p$ norms for $1 \le p \le \infty$, of separable (unentangled) matrices around the identity matrix. This implies a simple and…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We provide analytical lower and upper bounds for entanglement of formation for bipartite systems, which give a direct relation between the bounds of entanglement of formation and concurrence, and improve the previous results. Detailed…

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…