相关论文: Entangled Graphs
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
Grid states form a discrete set of mixed quantum states that can be described by graphs. We characterize the entanglement properties of these states and provide methods to evaluate entanglement criteria for grid states in a graphical way.…
We present a criterion for multiparticle entanglement based on covariance matrices. On the one hand, the criterion allows to detect bound entangled states which are not detected by other criteria; on the other hand, some strongly entangled…
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
We use the concept of \textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given partial information about the state in the…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
We study the conditions when mixtures of entangled pure states with maximally mixed one-qudit reduced density matrices remain entangled. We found that the resulting mixed state remains entangled when the number of entangled pure states to…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…
We investigate the detection of entanglement in $n$-partite quantum states. We obtain practical separability criteria to identify genuinely entangled and non-separable mixed quantum states. No numerical optimization or eigenvalue evaluation…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the Concentratable Entanglement of…
Braunstein et. al. have started the study of entanglement properties of the quantum states through graph theoretical approach. Their idea was to start from a simple unweighted graph $G$ and then they have defined the quantum state from the…
We present a method to derive separability criteria for the different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states.…