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

Niel de Beaudrap; Vittorio Giovannetti; Simone Severini; Richard Wilson

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

Niel de Beaudrap, Vittorio Giovannetti, Simone Severini, Richard Wilson

Computer Science

Research output: Working paper › Preprint

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 vertices. The number of equivalence classes of coentropic graphs with n vertices and m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.

Original language	English
Pages	1-7
Publication status	Published - 30 Apr 2013

Bibliographical note

7 pages, 1 figure

Keywords

math.CO

Access to Document

http://arxiv.org/abs/1304.7946

Cite this

@techreport{02accbd2a6d044dcb081beb38bd993f5,

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

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 vertices. The number of equivalence classes of coentropic graphs with n vertices and m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.",

keywords = "math.CO",

author = "{de Beaudrap}, Niel and Vittorio Giovannetti and Simone Severini and Richard Wilson",

note = "7 pages, 1 figure",

year = "2013",

month = apr,

day = "30",

language = "English",

pages = "1--7",

type = "WorkingPaper",

}

TY - UNPB

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

AU - de Beaudrap, Niel

AU - Giovannetti, Vittorio

AU - Severini, Simone

AU - Wilson, Richard

N1 - 7 pages, 1 figure

PY - 2013/4/30

Y1 - 2013/4/30

N2 - 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 vertices. The number of equivalence classes of coentropic graphs with n vertices and m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.

AB - 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 vertices. The number of equivalence classes of coentropic graphs with n vertices and m edges is a lower bound to the number of (pure) bipartite entanglement classes with subsystems of corresponding dimension.

KW - math.CO

M3 - Preprint

SP - 1

EP - 7

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

ER -