Related papers: Multipartite separability of density matrices of g…
Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
We investigate the separability of arbitrary dimensional tripartite sys- tems. By introducing a new operator related to transformations on the subsystems a necessary condition for the separability of tripartite systems is presented.
A geometrical characterization of robustly separable (that is, remaining separable under sufficiently small variiations) mixed states of a bipartite quantum system is given. It is shown that the density matrix of any such state can be…
A new hierarchy of separability conditions for bipartite states is obtained. All the conditions in the hierarchy are necessary for separability. The conditions are expressed in terms of higher powers of the density operator of the bipartite…
The recent proposed realignment separability criterion for mixed is analyzed. We identify the essential part of this criterion is a swap operator followed by a partial transposition. Then we analyze the separability criterion of permutation…
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
We show that pure states of multipartite quantum systems are multiseparable (i.e. give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition. Implications of this result for the…
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
We derive a hierarchy of separability criteria for multi-mode continuous variable systems. They permit to study in a unified way the k-partite entanglement of broad classes of Gaussian and non- Gaussian states. With specific examples we…
Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we…
The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein {\it et al.} [Phys. Rev. A \textbf{73}, 012320 (2006)]. The conjecture states…
We derive a necessary and sufficient condition for the separability of tripartite three mode Gaussian states, that is easy to check for any such state. We give a classification of the separability properties of those systems and show how to…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
It is known that complete multipartite graphs are determined by their distance spectrum but not by their adjacency spectrum. The Seidel spectrum of a graph $G$ on more than one vertex does not determine the graph, since any graph obtained…
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all…