Mathematical framework for describing multipartite entanglement in terms of rows or columns of coefficient matrices

In this paper, we develop a mathematical framework for describing entanglement quantitatively and qualitatively for multipartite qudit states in terms of rows or columns of coefficient matrices. More specifically, we propose an entanglement measure and separability criteria based on rows or columns of coefficient matrices. This entanglement measure has an explicit mathematical expression by means of exterior products of all pairs of rows or columns in coefficient matrices. It is introduced via our result that the [Formula: see text]-concurrence coincides with the entanglement measure based on two-by-two minors of coefficient matrices. Depending on our entanglement measure, we obtain the separability criteria and maximal entanglement criteria in terms of rows or columns of coefficient matrices. Our conclusions show that just like every two-by-two minor in a coefficient matrix of a multipartite pure state, every pair of rows or columns can also exhibit its entanglement properties, and thus can be viewed as its smallest entanglement contribution unit too. The great merit of our entanglement measure and separability criteria is two-fold. First, they are very practical and convenient for computation compared to other methods. Second, they have clear geometric interpretations.

Combo separability criteria and lower bound on concurrence

Detection and quantification of entanglement are extremely important in quantum information theory. We can extract information by using the spectrum or singular values of the density operator. The correlation matrix norm deals with the concept of quantum entanglement in a mathematically natural way. In this work, we use Ky Fan norm of the Bloch matrix to investigate the disentanglement of quantum states. Our separability criterion not only unifies some well-known criteria but also leads to a better lower bound on concurrence. We explain with an example how the entanglement of the given state is missed by existing criteria but can be detected by our criterion. The proposed lower bound on concurrence also has advantages over some investigated bounds.

Detection Power of Separability Criteria Based on a Correlation Tensor: A Case Study

Detection power of separability criteria based on a correlation tensor is tested within a family of generalized isotropic states in [Formula: see text]. For [Formula: see text] all these criteria are weaker than the positive partial transposition (PPT) criterion. Interestingly, our analysis supports the recent conjecture that a criterion based on symmetrically informationally complete positive operator-valued measure (SIC-POVMs) is stronger than realignment criterion.

Witnessing quantum memory in non-Markovian processes

We present a method to detect quantum memory in a non-Markovian process. We call a process Markovian when the environment does not provide a memory that retains correlations across different system-environment interactions. We define two types of non-Markovian processes, depending on the required memory being classical or quantum. We formalise this distinction using the process matrix formalism, through which a process is represented as a multipartite state. Within this formalism, a test for entanglement in a state can be mapped to a test for quantum memory in the corresponding process. This allows us to apply separability criteria and entanglement witnesses to the detection of quantum memory. We demonstrate the method in a simple model where both system and environment are single interacting qubits and map the parameters that lead to quantum memory. As with entanglement witnesses, our method of witnessing quantum memory provides a versatile experimental tool for open quantum systems.