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:1304.7946 · Contemporary mathematics - American Mathematical Society

Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs

Niel de Beaudrap, Vittorio Giovannetti, Simone Severini B, Richard C. Wilson

Published Jan 1, 2016• 13 citations
arXivHTMLPDF

Abstract

For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the edge-Laplacian. This provides an interpretation of the von Neumann entropy of the (normalized) Laplacian as the amount of quantum entanglement between two systems corresponding to vertices and edges. In this framework, cospectral graphs correspond exactly to local unitarily equivalent pure states. Finally, we introduce the notion of coentropic graphs, that is, graphs with equal von Neumann entropy. The smallest coentropic (but not cospectral) graphs that we are able to construct have 8 8 vertices. The number of equivalence classes of coentropic graphs with n n vertices and m m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.

DOI
10.1090/conm/658/13125

Related papers

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•13 citations

A Comparative Study on Correlation Measures of Pure Bipartite States through Incomparability

Amit Bhar, Indrani Chattopadhyay, Debasis Sarkar

The entanglement of a pure bipartite state is uniquely measured by the von-Neumann entropy of its reduced density matrices. Though it cannot specify all the non-local characteristics of pure entangled states. It was proven that for every possible value of entanglement of a bipartite system, there exists an infinite number of equally entangled pure states, not comparable(satisfies Nielsen’s criteria) to each other. In this work, we investigate other correlation measures of pure bipartite states that are able to differentiate the quantum correlations of the states with entropy of entanglement. In Schmidt rank 3, we consider the whole set of states having same entanglement and compare how minutely such states can be distinguished by other correlation measures. Then for different values of entanglement we compare the sets of states belonging to the same entanglement and also investigate the graphs of different correlation measures. We extend our search to Schmidt rank 4 and 5 also.

Journal of Quantum Information Science•Jan 1, 2012•0 citations

Separability of Graph Laplacian Quantum States: Utilizing Unitary Operators, Neighbourhood Sets and Equivalence Relation

Anoopa Joshi, Parvinder Singh, Kumar, Atul

This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the entanglement or separability of these states. We propose a set of criteria for ascertaining the separability of quantum states comprising $n$-qubit within a composite Hilbert space, indicated as $H=H_1 \otimes H_2 \otimes \dots \otimes H_n$. This determination is achieved through a combination of unitary operators, neighbourhood sets, and equivalence relations.

arXiv:2401.02289•Jan 4, 2024•1 citation

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

A. S. Holevo, M. E. Shirokov

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state $ρ$ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality $\,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the rank of $ρ$. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state $ρ$ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality $\,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the Schmidt rank of $ρ$. In both cases the optimal constant $C_ρ$ is equal to the optimal constant $K_{d}$ in the log-Sobolev inequality for the complete graph with $d$ vertices: in the first case $d=\mathrm{rank}ρ$, in the second one $d=\mathrm{rank}ρ_A=\mathrm{rank}ρ_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

quant-pharXiv:2609.12667•Sep 14, 2026•2 citations

Variational estimation of entanglement entropy for bipartite many-body systems

Takaaki Monnai

Abstract We explore a variational characterization of the bipartite entanglement entropy such as von Neumann entropy for pure states in terms of general projective measurements of an arbitrary system. By properly choosing the measurement basis, we show that a general estimation of the bipartite entanglement measure can be explicitly written. The number of projective measurement operators of the subsystem necessary for calculating an upper bound of the bipartite entanglement entropy is less than or equal to the dimension of the smaller subsystem. This number is much smaller than that of the full tomography of the density matrix. As an application, our method is useful to estimate the entanglement entropy of each energy eigenstate of a given Hamiltonian.

Journal of Statistical Mechanics Theory and Experiment•Nov 1, 2019•0 citations

Multiparty entanglement in graph states

M. Hein, Jens Eisert, Hans J. Briegel

Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.

arXiv:quant-ph/0307130•Physical Review A•Jun 9, 2004•1,119 citations
For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the edge-Laplacian. This provides an interpretation of the von Neumann entropy of the (normalized) Laplacian as the amount of quantum entanglement between two systems corresponding to vertices and edges. In this framework, cospectral graphs correspond exactly to local unitarily equivalent pure states. Finally, we introduce the notion of coentropic graphs, that is, graphs with equal von Neumann entropy. The smallest coentropic (but not cospectral) graphs that we are able to construct have 8 8 vertices. The number of equivalence classes of coentropic graphs with n n vertices and m m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.
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.
The entanglement of a pure bipartite state is uniquely measured by the von-Neumann entropy of its reduced density matrices. Though it cannot specify all the non-local characteristics of pure entangled states. It was proven that for every possible value of entanglement of a bipartite system, there exists an infinite number of equally entangled pure states, not comparable(satisfies Nielsen’s criteria) to each other. In this work, we investigate other correlation measures of pure bipartite states that are able to differentiate the quantum correlations of the states with entropy of entanglement. In Schmidt rank 3, we consider the whole set of states having same entanglement and compare how minutely such states can be distinguished by other correlation measures. Then for different values of entanglement we compare the sets of states belonging to the same entanglement and also investigate the graphs of different correlation measures. We extend our search to Schmidt rank 4 and 5 also.
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the entanglement or separability of these states. We propose a set of criteria for ascertaining the separability of quantum states comprising nnn-qubit within a composite Hilbert space, indicated as H=H1⊗H2⊗⋯⊗HnH=H_1 \otimes H_2 \otimes \dots \otimes H_nH=H1​⊗H2​⊗⋯⊗Hn​. This determination is achieved through a combination of unitary operators, neighbourhood sets, and equivalence relations.
We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρρρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality  S(ρ)−S(σ)≤Cρ(1−F(ρ,σ)) \,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,S(ρ)−S(σ)≤Cρ​(1−F(ρ,σ)) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the rank of ρρρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρρρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality  EF(ρ)−EF(σ)≤Cρ(1−Trρσ) \,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,EF​(ρ)−EF​(σ)≤Cρ​(1−Trρσ) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the Schmidt rank of ρρρ. In both cases the optimal constant CρC_ρCρ​ is equal to the optimal constant KdK_{d}Kd​ in the log-Sobolev inequality for the complete graph with ddd vertices: in the first case d=rankρd=\mathrm{rank}ρd=rankρ, in the second one d=rankρA=rankρBd=\mathrm{rank}ρ_A=\mathrm{rank}ρ_Bd=rankρA​=rankρB​. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
Abstract We explore a variational characterization of the bipartite entanglement entropy such as von Neumann entropy for pure states in terms of general projective measurements of an arbitrary system. By properly choosing the measurement basis, we show that a general estimation of the bipartite entanglement measure can be explicitly written. The number of projective measurement operators of the subsystem necessary for calculating an upper bound of the bipartite entanglement entropy is less than or equal to the dimension of the smaller subsystem. This number is much smaller than that of the full tomography of the density matrix. As an application, our method is useful to estimate the entanglement entropy of each energy eigenstate of a given Hamiltonian.
Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.