Related papers: Separability criteria based on the realignment of …
We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
Entanglement is a cornerstone in quantum information science, yet detecting it efficiently remains a challenging task. Focusing on non-positive partially transposed (NPT) states, we establish a hierarchy among entropy-based, majorization,…
While entanglement is believed to be an important ingredient in understanding quantum many-body physics, the complexity of its characterization scales very unfavorably with the size of the system. Finding super-sets of the set of separable…
It is a hard and important problem to find the criterion of the set of positive-definite matrixes which can be written as reduced density operators of a multi-partite quantum state. This problem is closely related to the study of many-body…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
A geometrical picture of separability of 2 x 2 composite quantum systems, showing the region of separable density matrices in the space of hermitian matrices, is given. It rests on the criterion of separability given by Peres, and it is an…
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…
One of the most challenging problems in quantum physics is to quantify the entanglement of $d$-partite states and their separability. We show here that these problems are best addressed using tensors. The geometric measure of entanglement…
Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…
In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…
We present two sets of computable entanglement measures for multipartite systems where each subsystem can have different degrees of freedom (so-called qudits). One set, called 'separability' measure, reveals which of the subsystems are…
In this paper, based on a matrix norm, we first present a ball of separable unnormalized states around the identity matrix for the bipartite quantum system, which is larger than the separable ball in Frobenius norm. Then the proposed ball…
We treat 3-qubits states with maximally disordered subsystems, by using Hilbert-Schmidt decompositions.By using unfolding methods, the tensors are converted into matrices and by applying singular values decompositions to these matrices the…
We study the norms of the Bloch vectors for arbitrary $n$-partite quantum states. A tight upper bound of the norms is derived for $n$-partite systems with different individual dimensions. These upper bounds are used to deal with the…
We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in n-qubit Dicke states with…
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…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
This paper present a geometric diagram of a separable state: If a mixed state $\sigma $ is separable, there are $2^{nS(\sigma)}$ linearly independant product vectors which span the same Hilbert space as the $2^{nS(\sigma)}$ ``likely''…
The experimental detection of quantum entanglement is of great importance in quantum information processing. We present two separability criteria based on the generalized realignment moments. By incorporating additional parameters, these…