Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1010.2078 · International Journal of Theoretical Physics

Detecting Entanglement of States by Entries of Their Density Matrices

Xiaofei Qi, Jinchuan Hou

Published Feb 1, 2012• 5 citations
arXivHTMLPDF
DOI
10.1007/s10773-012-1079-9

Related papers

Detection of Multipartite Entanglement Based on Heisenberg-Weyl Representation of Density Matrices

Hui Zhao, Yu Meng Yang, Naihuan Jing +2 more

arXiv:2205.15493•International Journal of Theoretical Physics•May 1, 2022•4 citations

Detection of genuine tripartite entanglement based on Bloch representation of density matrices

Hui Zhao, Yu-Qiu Liu, Naihuan Jing +2 more

arXiv:2203.14183•Quantum Information Processing•Mar 1, 2022•6 citations

Detection of quantum entanglement in physical systems

Carolina Alves

•Jan 1, 2005•2 citations

Detection of d 1 ⨂ d 2 dimensional bipartite entangled state: a graph theoretical approach

Rohit Kumar, Satyabrata Adhikari

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 ϕ such that ϕ ( ρ ) = L ρ + ρ , where the quantum state is described by the density operator ρ . The entries of L ρ depends on the entries of the quantum state ρ and the entries are taken in such a way that L ρ satisfies all the properties of the Laplacian. This make possible to design a simple connected weighted graph from the Laplacian L ρ . We show that the constructed unital map ϕ characterize the quantum state with respect to its purity by showing that if the determinant of the matrix ϕ ( ρ ) − I is positive then the quantum state ρ 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 ⨂ d 2 dimensional bipartite quantum states. Lastly, we have illustrated our results with few examples.

arXiv:2202.13963•Physica Scripta•Nov 11, 2022•0 citations

Real State Transfer

Chris D. Godsil

A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent by density matrices, positive semidefinite matrices with rows and columns indexed by $V(X)$ and with trace $1$. The square of the absolute values of the entries of a column of $U(t)$ define a probability density on $V(X)$, and it is precisely these densities that predict the outcomes of measurements. There are two special cases of physical interest: when the column density is supported on a vertex, and when it is uniform. In the first case we have perfect state transfer; in the second, uniform mixing. There are many results concerning state transfer and uniform mixing. In this paper we show that these results on perfect state transfer hold largely because at the time it occurs, the density matrix is real. We also show that the results on uniform mixing obtained so far hold because the entries of the density matrix are algebraic numbers. As a consequence of these we derive strong restrictions on the occurence of uniform mixing on bipartite graphs and on oriented graphs.

arXiv:1710.04042•Oct 11, 2017•13 citations

Detecting quantum entanglement

Barbara M. Terhal

arXiv:quant-ph/0101032•Theoretical Computer Science•Sep 1, 2002•298 citations
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 ϕ such that ϕ ( ρ ) = L ρ + ρ , where the quantum state is described by the density operator ρ . The entries of L ρ depends on the entries of the quantum state ρ and the entries are taken in such a way that L ρ satisfies all the properties of the Laplacian. This make possible to design a simple connected weighted graph from the Laplacian L ρ . We show that the constructed unital map ϕ characterize the quantum state with respect to its purity by showing that if the determinant of the matrix ϕ ( ρ ) − I is positive then the quantum state ρ 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 ⨂ d 2 dimensional bipartite quantum states. Lastly, we have illustrated our results with few examples.
A continuous quantum walk on a graph XXX with adjacency matrix AAA is specified by the 1-parameter family of unitary matrices U(t)=exp⁡(itA)U(t)=\exp(itA)U(t)=exp(itA). These matrices act on the state space of a quantum system, the states of which we may represent by density matrices, positive semidefinite matrices with rows and columns indexed by V(X)V(X)V(X) and with trace 111. The square of the absolute values of the entries of a column of U(t)U(t)U(t) define a probability density on V(X)V(X)V(X), and it is precisely these densities that predict the outcomes of measurements. There are two special cases of physical interest: when the column density is supported on a vertex, and when it is uniform. In the first case we have perfect state transfer; in the second, uniform mixing. There are many results concerning state transfer and uniform mixing. In this paper we show that these results on perfect state transfer hold largely because at the time it occurs, the density matrix is real. We also show that the results on uniform mixing obtained so far hold because the entries of the density matrix are algebraic numbers. As a consequence of these we derive strong restrictions on the occurence of uniform mixing on bipartite graphs and on oriented graphs.