Related papers: Separable approximations of density matrices of co…
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward,…
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…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
The separability and entanglement of quantum mixed states in $\Cb^2 \otimes \Cb^3 \otimes \Cb^N$ composite quantum systems are investigated. It is shown that all quantum states $\rho$ with positive partial transposes and rank $r(\rho)\leq…
We study the separability of bipartite quantum systems in arbitrary dimensions based on the Bloch representation of density matrices. We present two separability criteria for quantum states in terms of the matrices $T_{\alpha\beta}(\rho)$…
We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information…
We consider the actions of protocols involving local quantum operations and classical communication (LQCC) on a single system consisting of two separated qubits. We give a complete description of the orbits of the space of states under LQCC…
An important measure of bipartite entanglement is the entanglement of formation, which is defined as the minimum average pure state entanglement of all decompositions realizing a given state. A decomposition which achieves this minimum is…
A simple entanglement measure for multipartite pure states is formulated based on the partial entropy of a series of reduced density matrices. Use of the proposed new measure to distinguish disentangled, partially entangled, and maximally…
Given a finite number $N$ of copies of a qubit state we compute the maximum fidelity that can be attained using joint-measurement protocols for estimating its purity. We prove that in the asymptotic $N\to\infty$ limit, separable-measurement…
The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state is defined as the minimum average entanglement of an ensemble of pure…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
In this study, we investigate the problem of determining the maximum purity for absolutely separable and absolutely PPT quantum states. From the geometric viewpoint, this problem is equivalent to asking for the exact Euclidean radius of the…
Local Operations enhancing the entanglement of bipartite quantum states are of great interest in quantum information processing. Subject of this paper are local selective operations acting on single copies of states. Such operations can…
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…
Given the density matrix rho of a bipartite quantum state, the quantum separability problem asks whether rho is entangled or separable. In 2003, Gurvits showed that this problem is NP-hard if rho is located within an inverse exponential…
The optimal (pure state) ensemble length of a separable state, A, is the minimum number of (pure) product states needed in convex combination to construct A. We study the set of all separable states with optimal (pure state) ensemble length…
Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally…
We present an abstract formulation of the so-called Innsbruck-Hannover programme that investigates quantum correlations and entanglement in terms of convex sets. We present a unified description of optimal decompositions of quantum states…