Related papers: The tripartite separability of density matrices of…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
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…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
The correlation matrices or tensors in the Bloch representation of density matrices are encoded with entanglement properties. In this paper, based on the Bloch representation of density matrices, we give some new separability criteria for…
In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be…
We study the entanglement in tripartite quantum systems by using the principal basis matrix representations of density matrices. Using the Schmidt decomposition and local unitary transformation, we first convert the general states to…
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…
We study separability criteria in multipartite quantum systems of arbitrary dimensions by using the Bloch representation of density matrices. We first derive the norms of the correlation tensors and obtain the necessary conditions for…
We explicitly describe the possible pairs of triangle and square densities for r-regular finite simple graphs. We also prove that every r-regular unimodular random graph can be approximated by r-regular finite graphs with respect to these…
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs,…
The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…
Let $n,k$ be positive integers such that $n\geq k$ and $G$ be a tripartite graph with parts $A,B,C$ such that $|A|=|B|=|C|=n$. Denote the edge densities of $G[A,B]$, $G[A,C]$ and $G[B,C]$ by $\alpha$, $\beta$ and $\gamma$, respectively. In…
It has been observed that the reduced density matrices of bipartite qudit pure states possess a Gram matrix structure. This observation has opened a possibility of analysing the entanglement in such systems from the purely geometrical point…
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…
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…
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
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…