Related papers: Lower bounds on concurrence and separability condi…
We study the trade-off relations given by the l_1-norm coherence of general multipartite states. Explicit trade-off inequalities are derived with lower bounds given by the coherence of either bipartite or multipartite reduced density…
We introduce a class of inequalities based on low order correlations of operators to detect entanglement in bipartite systems. The operators may either be Hermitian or non-Hermitian and are applicable to any physical system or class of…
In this article, we present a set of hierarchy Bloch equations for the reduced density operators in either canonical or grand canonical ensembles in the occupation number representation. They provide a convenient tool for studying the…
We show that bipartite Bell inequalities based on the Einstein-Podolsky-Rosen criterion for elements of reality and derived from the properties of some hyperentangled states allow feasible experimental verifications of the fact that quantum…
For a bipartite quantum system consisting of subsystems A and B it was shown by Zhang et al. (Physics Letters A 376 (2012) 3588-3592) that the amount of classical correlations, which is used to define the quantum discord, is known to be…
In this paper, the realignment criterion and the RCCN criterion of separability for states in infinite-dimensional bipartite quantum systems are established. Let $H_A$ and $H_B$ be complex Hilbert spaces with $\dim H_A\otimes H_B=+\infty$.…
We introduce a complete set of complementary quantities in bipartite, two-dimensional systems. Complementarity then relates the quantitative entanglement measure concurrence which is a bipartite property to the single-particle quantum…
To quantify the entanglement of bipartite systems in terms of some entanglement measure is a challenging problem in general, and it is much worse when the information about the system is less. In this manuscript, based on two classes of…
We formulate an entanglement criterion using Peres-Horodecki positive partial transpose operations combined with the Schr\"odinger-Robertson uncertainty relation. We show that any pure entangled bipartite and tripartite state can be…
Euclidean volume ratios between quantum states with positive partial transpose and all quantum states in bipartite systems are investigated. These ratios allow a quantitative exploration of the typicality of entanglement and of its…
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…
Quantum entanglement plays a pivotal role in quantum information processing. Quantifying quantum entanglement is a challenging and essential research area within the field. This manuscript explores the relationships between bipartite…
One of the main goals in the study of quantum nonlocality is to determine the maximum violation achieved by quantum correlations in a Bell scenario. However, given a Bell inequality, there is no general algorithm to perform this task. As an…
We derive an experimentally observable lower bound on concurrence of mixed quantum states in terms of an entanglement witness, relating measurements on single states with those on two copies.
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 study monogamy relations for arbitrary dimensional multipartite systems. Monogamy relations based on concurrence and concurrence of assistance for any dimensional $m_1\otimes m_2\otimes...\otimes m_{N}$ quantum states are derived, which…
In this paper we use the \textit{concurrence vector}, as a measure of entanglement, and investigate lower and upper bounds on the concurrence of a superposition of bipartite states as a function of the concurrence of the superposed states.…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
We give a set of necessary conditions for locality in bipartite systems, which include and generalize known Bell's inequalities. Each condition corresponds to a specific order of the expansion of random variables defined on graphs, in terms…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…