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:quant-ph/0602053 · Journal of Physics A Mathematical and Theoretical

A combinatorial approach to multipartite quantum systems: basic formulation

Ali Saif M. Hassan, Pramod S. Joag

Published Aug 1, 2007• 13 citations
arXivHTMLPDF

Abstract

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study related issues such as classification of pure and mixed states, Von Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we show that Werner's definition (Werner 1989 Phys. Rev. A 40 4277) of a separable state can be written in terms of graphs, for the states in a real or complex Hilbert space. We generalize the separability criterion (degree criterion) due to Braunstein et al (2006 Phys. Rev. A 73 012320) to a class of weighted graphs with real weights. We have given some criteria for the Laplacian associated with a weighted graph to be positive semidefinite.

DOI
10.1088/1751-8113/40/33/019

Related papers

Graph representation of quantum states

Bibhas Adhikari, Satyabrata Adhikari, Subhashish Banerjee

In this work we propose graphical representation of quantum states. Pure states require weighted digraphs with complex weights, while mixed states need, in general, edge weighted digraphs with loops; constructions which, to the best of our knowledge, are new in the theory of graphs. Both the combinatorial as well as the signless Laplacian are used for graph representation of quantum states. We also provide some interesting analogies between physical processes and graph representations. Entanglement between two qubits is approached by the development of graph operations that simulate quantum operations, resulting in the generation of Bell and Werner states. As a biproduct, the study also leads to separability criteria using graph operations. This paves the way for a study of genuine multipartite correlations using graph operations.

•May 12, 2012•1 citation

The Tripartite Separability of Density Matrices of Graphs

Zhen Wang, Zhi‐Xi Wang

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 discussed in Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

arXiv:0705.2561•The Electronic Journal of Combinatorics•May 23, 2007•7 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

Separability of Density Matrices of Graphs for Multipartite Systems

Chen Xie, Hui Zhao, Zhi‐Xi Wang

We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of the tensor product of N graphs is N-separable. However, the converse is not necessarily true. Additionally, we derive a sufficient condition for N-partite entanglement in star graphs and propose a necessary and sufficient condition for separability of nearest point graphs.

The Electronic Journal of Combinatorics•Nov 22, 2013•5 citations

Combinatorial structures in quantum correlation: A new perspective

Rohit kumar, Satyabrata Adhikari

Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_α$-graph states, which are constructed from either unweighted or weighted graphs by taking the normalised convex combination of the degree matrix $D$ and the adjacency matrix $A_G$ of a graph $G$. The constructed states are different from the standard graph states arising from stabiliser formalism. Our approach is also different from the approach used by Braunstein et al. This class of states depend on a tunable mixing parameter $α\in (0,1]$. We first establish the conditions under which the associated operator $ρ_α^{A_G}$ is positive semidefinite and hence represents a valid quantum state. We then derive a positive partial transposition (PPT) condition for $A_α$-graph states in terms of graph parameters. This PPT condition involves only the Frobenius norm of the adjacency matrix of the graph, the degrees of the vertices and the total number of vertices. For simple graphs, we obtain the range of the parameter $α$ for which the $A_α$-graph states represent a class of entangled states. We then develop a graph-theoretic formulation of a moments-based entanglement detection criterion, focusing on the recently proposed $p_3$-PPT criterion, which relies on the second and third moments of the partial transposition. Since the estimation of these moments is experimentally accessible via randomised measurements, swap operations, and machine-learning-based protocols, our approach provides a physically relevant framework for detecting entanglement in structured quantum states derived from graphs. This work bridges graph theory and moments-based entanglement detection, offering a new perspective on the role of combinatorial structures in quantum correlations.

quant-pharXiv:2512.15686•Annals of Physics•Dec 18, 2025•0 citations

Multipartite Separability of Laplacian Matrices of Graphs

Chai Wah Wu

Recently, Braunstein et al. introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying graphs. We provide further results on the multipartite separability of Laplacian matrices of graphs. In particular, we identify complete bipartite graphs whose normalized Laplacian matrix is multipartite entangled under any vertex labeling. Furthermore, we give conditions on the vertex degrees such that there is a vertex labeling under which the normalized Laplacian matrix is entangled. These results address an open question raised in Braunstein et al. Finally, we show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, lexicographical, etc.) is multipartite separable, extending analogous results for bipartite and tripartite separability.

arXiv:0809.0827•The Electronic Journal of Combinatorics•May 15, 2009•11 citations
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study related issues such as classification of pure and mixed states, Von Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we show that Werner's definition (Werner 1989 Phys. Rev. A 40 4277) of a separable state can be written in terms of graphs, for the states in a real or complex Hilbert space. We generalize the separability criterion (degree criterion) due to Braunstein et al (2006 Phys. Rev. A 73 012320) to a class of weighted graphs with real weights. We have given some criteria for the Laplacian associated with a weighted graph to be positive semidefinite.
In this work we propose graphical representation of quantum states. Pure states require weighted digraphs with complex weights, while mixed states need, in general, edge weighted digraphs with loops; constructions which, to the best of our knowledge, are new in the theory of graphs. Both the combinatorial as well as the signless Laplacian are used for graph representation of quantum states. We also provide some interesting analogies between physical processes and graph representations. Entanglement between two qubits is approached by the development of graph operations that simulate quantum operations, resulting in the generation of Bell and Werner states. As a biproduct, the study also leads to separability criteria using graph operations. This paves the way for a study of genuine multipartite correlations using graph operations.
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 discussed in Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
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.
We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of the tensor product of N graphs is N-separable. However, the converse is not necessarily true. Additionally, we derive a sufficient condition for N-partite entanglement in star graphs and propose a necessary and sufficient condition for separability of nearest point graphs.
Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called AαA_αAα​-graph states, which are constructed from either unweighted or weighted graphs by taking the normalised convex combination of the degree matrix DDD and the adjacency matrix AGA_GAG​ of a graph GGG. The constructed states are different from the standard graph states arising from stabiliser formalism. Our approach is also different from the approach used by Braunstein et al. This class of states depend on a tunable mixing parameter α∈(0,1]α\in (0,1]α∈(0,1]. We first establish the conditions under which the associated operator ραAGρ_α^{A_G}ραAG​​ is positive semidefinite and hence represents a valid quantum state. We then derive a positive partial transposition (PPT) condition for AαA_αAα​-graph states in terms of graph parameters. This PPT condition involves only the Frobenius norm of the adjacency matrix of the graph, the degrees of the vertices and the total number of vertices. For simple graphs, we obtain the range of the parameter ααα for which the AαA_αAα​-graph states represent a class of entangled states. We then develop a graph-theoretic formulation of a moments-based entanglement detection criterion, focusing on the recently proposed p3p_3p3​-PPT criterion, which relies on the second and third moments of the partial transposition. Since the estimation of these moments is experimentally accessible via randomised measurements, swap operations, and machine-learning-based protocols, our approach provides a physically relevant framework for detecting entanglement in structured quantum states derived from graphs. This work bridges graph theory and moments-based entanglement detection, offering a new perspective on the role of combinatorial structures in quantum correlations.
Recently, Braunstein et al. introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying graphs. We provide further results on the multipartite separability of Laplacian matrices of graphs. In particular, we identify complete bipartite graphs whose normalized Laplacian matrix is multipartite entangled under any vertex labeling. Furthermore, we give conditions on the vertex degrees such that there is a vertex labeling under which the normalized Laplacian matrix is entangled. These results address an open question raised in Braunstein et al. Finally, we show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, lexicographical, etc.) is multipartite separable, extending analogous results for bipartite and tripartite separability.