Detection of $d_1\otimes d_2$ Dimensional Bipartite Entangled State: A Graph Theoretical Approach

Abstract

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 Laplacian of the graph $G$. A lot of research had already been done using the similar idea. We ask here the opposite one i.e can we generate a graph from the density matrix? To investigate this question, we have constructed a unital map $\varphi$ such that $\varphi (\rho )=L_{\rho }+\rho$, where the quantum state is described by the density operator $\rho$. The entries of $L_{\rho }$ depends on the entries of the quantum state $\rho$ and the entries are taken in such a way that $L_{\rho }$ satisfies all the properties of the Laplacian. This make possible to design a simple connected weighted graph from the Laplacian $L_{\rho }$. We show that the constructed unital map $\varphi$ characterize the quantum state with respect to its purity by showing that if the determinant of the matrix $\varphi (\rho )-I$ is positive then the quantum state $\rho$ represent a mixed state. Moreover, we study the positive partial transpose (PPT) criterion in terms of the spectrum of the density matrix under investigation and the spectrum of the Laplacian associated with the given density matrix. Furthermore, we derive the inequality between the minimum eigenvalue of the density matrix and the weight of the edges of the connected subgraph of a simple weighted graph to detect the entanglement of $d_1\otimes d_2$ dimensional bipartite quantum states. Lastly, We have illustrated our results with few examples.

arXiv comment11 Pages, 5 Figures

References in corpus (20)

• Quantum entanglement
• Quantum Cryptography
• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Entanglement detection
• Separability criterion and inseparable mixed states with positive partial transposition
• On the role of entanglement in quantum computational speed-up
• Direct estimations of linear and non-linear functionals of a quantum state
• Universal Quantum Estimator
• Graph-Theoretic Approach to Quantum Correlations
• Further results on the cross norm criterion for separability
• Separable states are more disordered globally than locally
• Evidence for Bound Entangled States with Negative Partial Transpose
• The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• Some families of density matrices for which separability is easily tested
• Detecting mixedness of qutrit systems using the uncertainty relation
• Bipartite separability and non-local quantum operations on graphs
• Entanglement properties of quantum grid states
• A matrix realignment method for recognizing entanglement
• Detection of mixed bipartite entangled state in arbitrary dimension via structural physical approximation of partial transposition