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

Chinese Physics Letters

Separability of Generalized Graph Product States

Hui Zhao, Jiao Fan

Published Sep 1, 2013• 4 citations
Publisher

Abstract

We construct two classes of generalized graph product states and study the entanglement of these states. It is first presented that the density matrices of complex edge-weighted digraphs associated with the generalized graph product in m⊗n systems are positive partial transformation and separable states. Then we prove that the density matrices of the vertex-weighted digraphs associated with another generalized graph product are entangled states.

DOI
10.1088/0256-307x/30/9/090303

Related papers

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

Multipartite separability of Laplacian matrices of graphs

Chai Wah Wu

Recently, Braunstein et al. [1] 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 [1]. Finally, we extend some of the results in [1,2] to the multipartite case and show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, categorical, etc.) is multipartite separable.

arXiv:0809.0827•Sep 4, 2008•0 citations

A combinatorial approach to multipartite quantum systems: basic formulation

Ali Saif M. Hassan, Pramod S. Joag

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.

arXiv:quant-ph/0602053•Journal of Physics A Mathematical and Theoretical•Aug 1, 2007•14 citations

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

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.

The Electronic Journal of Combinatorics•May 15, 2009•11 citations

Entangled graphs

Martin Plesch, Vladimír Bužek

We study how bi-partite quantum entanglement (measured in terms of a concurrence) can be shared in multi-qubit systems. We introduce a concept of the entangled graph such that each qubit of a multi-partite system is associated with a vertex while a bi-partite entanglement between two specific qubits is represented by an edge. We prove that any entangled graph can be associated with a pure state of a multi-qubit system. We also derive bounds on the concurrence for some weighted entangled graphs (the weight corresponds to the value of concurrence associated with the given edge).

Quantum Information and Computation•Nov 1, 2002•2 citations
We construct two classes of generalized graph product states and study the entanglement of these states. It is first presented that the density matrices of complex edge-weighted digraphs associated with the generalized graph product in m⊗n systems are positive partial transformation and separable states. Then we prove that the density matrices of the vertex-weighted digraphs associated with another generalized graph product are entangled states.
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.
Recently, Braunstein et al. [1] 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 [1]. Finally, we extend some of the results in [1,2] to the multipartite case and show that the Laplacian matrix of any product of graphs (strong, Cartesian, tensor, categorical, etc.) is multipartite separable.
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.
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.
We study how bi-partite quantum entanglement (measured in terms of a concurrence) can be shared in multi-qubit systems. We introduce a concept of the entangled graph such that each qubit of a multi-partite system is associated with a vertex while a bi-partite entanglement between two specific qubits is represented by an edge. We prove that any entangled graph can be associated with a pure state of a multi-qubit system. We also derive bounds on the concurrence for some weighted entangled graphs (the weight corresponds to the value of concurrence associated with the given edge).