Related papers: Towards efficient algorithm deciding separability …

We propose generalizations of concurrence for multi-partite quantum systems that can distinguish qualitatively distinct quantum correlations. All introduced quantities can be evaluated efficiently for arbitrary mixed sates.

We study the entanglement of multipartite quantum states. Some lower bounds of the multipartite concurrence are reviewed. We further present more effective lower bounds for detecting and qualifying entanglement, by establishing functional…

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes…

We study the local unitary equivalence of arbitrary dimensional multipartite quantum mixed states. We present a necessary and sufficient criterion of the local unitary equivalence for general multipartite states based on matrix realignment.…

Based on the ranks of reduced density matrices, we derive necessary conditions for the separability of multiparticle arbitrary-dimensional mixed states, which are equivalent to sufficient conditions for entanglement. In a similar way we…

We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits…

Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…

We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…

A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…

Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the…

In this article we extend results from our previous work [Bendersky, de la Torre, Senno, Figueira and Ac\'in, Phys. Rev. Lett. 116, 230406 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success…

By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $\rho$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the…

We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…

We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…

We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…

We give an universal algorithm for testing the local unitary equivalence of states for multipartite system with arbitrary dimensions.

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…

We study generalized concurrences as a tool to detect the entanglement of bipartite quantum systems. By considering the case of 2 X 4 states of rank 2, we prove that generalized concurrences do not, in general, give a necessary and…

We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow to detect the entanglement…

In this paper, we discuss the partial separability and its criteria problems of multipartite qubit mixed-states. First we strictly define what is the partial separability of a multipartite qubit system. Next we give a reduction way from…