Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Symmetric Laplacians, quantum density matrices and their Von Neumann entropy

Tools
- Tools
+ Tools

Simmons, David, Coon, Justin and Datta, Animesh (2017) Symmetric Laplacians, quantum density matrices and their Von Neumann entropy. Linear Algebra and Its Applications, 532 . pp. 534-549. ISSN 0024-3795.

[img]
Preview
PDF
WRAP-symmetric-Laplacians-quantum-density-matrices-Von-Neumann-entropy-Datta-2017.pdf - Accepted Version - Requires a PDF viewer.

Download (705Kb) | Preview
Official URL: https://doi.org/10.1016/j.laa.2017.06.038

Request Changes to record.

Abstract

We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other corresponding to the edges). This suggests an interpretation of the symmetric Laplacian's Von Neumann entropy as a measure of bipartite entanglement present between the two parts of the state. We then study extreme values for a connected graph's generalized R\'enyi-p entropy. Specifically, we show that

(1) the complete graph achieves maximum entropy,
(2) the 2-regular graph: a) achieves minimum R\'enyi-2 entropy

among all k-regular graphs, b) is within log4/3 of the minimum R\'enyi-2 entropy and log42‾√/3 of the minimum Von Neumann entropy among all connected graphs, c) achieves a Von Neumann entropy less than the star graph.

Point (2) contrasts sharply with similar work applied to (normalized) combinatorial Laplacians, where it has been shown that the star graph almost always achieves minimum Von Neumann entropy. In this work we find that the star graph achieves maximum entropy in the limit as the number of vertices grows without bound.

Item Type: Journal Article
Subjects: Q Science > QC Physics
Divisions: Faculty of Science, Engineering and Medicine > Science > Physics
Library of Congress Subject Headings (LCSH): Laplacian matrices, Hilbert space
Journal or Publication Title: Linear Algebra and Its Applications
Publisher: Elsevier Inc
ISSN: 0024-3795
Official Date: 1 November 2017
Dates:
DateEvent
1 November 2017Published
14 July 2017Available
22 June 2017Accepted
Volume: 532
Page Range: pp. 534-549
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 17 July 2017
Date of first compliant Open Access: 14 July 2018
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
EP/K04057X/2[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
EP/M013243/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us