Related papers: X-matrices provide a lower bound of concurrence
Quantum discord is a function of density-matrix elements (and through them, e.~g., of temperature, applied fields, time, and so forth). The domain of such a function in the case of two-qubit system with X or centrosymmetric (CS) density…
In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum…
We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…
The probability that a generic real, complex or quaternionic two-qubit state is separable can be considered to be the sum of three contributions. One is from those states that are absolutely separable, that is those (which can not be…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
We propose a general scheme to measure the concurrence of an arbitrary two-qubit pure state in atomic systems. The protocol is based on one- and two-qubit operations acting on two available copies of the bipartite system, and followed by a…
The problem of determining when entanglement is present in a quantum system is one of the most active areas of research in quantum physics. Depending on the setting at hand, different notions of entanglement (or lack thereof) become…
We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product…
We present reduction theorems for the problem of optimal unambiguous state discrimination (USD) of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank $n$ and are…
Let L_n be the n-dimensional Lorentz cone. A linear map M from R^m to R^n is called Lorentz-positive if M[L_m] is contained in L_n. We extend the notion of concurrence, which was initially introduced to quantify the entanglement of…
We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that…
In this paper we describe a set of circuits that can measure the concurrence of a two qubit density matrix without requiring the deliberate addition of noise. We then extend these methods to obtain a circuit to measure one type of three…
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…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
A quantum system consisting of two subsystems is separable if its density matrix can be written as $\rho=\sum w_K \rho_K'\otimes \rho_K''$, where $\rho_K'$ and $\rho_K''$ are density matrices for the two subsytems, and the positive weights…
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…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble…
Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with…
In the present paper the cross norm criterion for separability of density matrices is studied. In the first part of the paper we determine the value of the greatest cross norm for Werner states, for isotropic states and for Bell diagonal…