The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
From MaRDI portal
Publication:858019
DOI10.1007/S00026-006-0289-3zbMATH Open1106.05057arXivquant-ph/0406165OpenAlexW3100495106MaRDI QIDQ858019FDOQ858019
Authors: Samuel L. Braunstein, Sibasish Ghosh, Simone Severini 
Publication date: 5 January 2007
Published in: Annals of Combinatorics (Search for Journal in Brave)
Abstract: We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that the density matrix of a graph can be always written as a uniform mixture of pure density matrices of graphs. We consider the von Neumann entropy of these matrices and we characterize the graphs for which the minimum and maximum values are attained. We then discuss the problem of separability by pointing out that separability of density matrices of graphs does not always depend on the labelling of the vertices. We consider graphs with a tensor product structure and simple cases for which combinatorial properties are linked to the entanglement of the state. We calculate the concurrence of all graph on four vertices representing entangled states. It turns out that for some of these graphs the value of the concurrence is exactly fractional.
Full work available at URL: https://arxiv.org/abs/quant-ph/0406165
Recommendations
- Combinatorial laplacians and positivity under partial transpose
- The tripartite separability of density matrices of graphs
- A combinatorial approach to multipartite quantum systems: basic formulation
- Separability of density matrices of graphs for multipartite systems
- Multipartite separability of Laplacian matrices of graphs
Cited In (44)
- A note on the degree conjecture for separability of multipartite quantum states
- Separability of density matrices of graphs for multipartite systems
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Laplacian matrices of weighted digraphs represented as quantum states
- Note on von Neumann and Rényi entropies of a graph
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- Concurrence and three-tangle of the graph
- Entropy of tournament digraphs
- Bipartite quantum states and random complex networks
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Depth-based hypergraph complexity traces from directed line graphs
- On the von Neumann entropy of a graph
- Entanglement and separability of graph Laplacian quantum states
- Incremental measurement of structural entropy for dynamic graphs
- New Minkowski type inequalities and entropic inequalities for quantum states of qudits
- Quantum entanglement \& purity testing: a graph zeta function perspective
- Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy
- A graph theoretical approach to states and unitary operations
- Combinatorial entanglement
- Ranking nodes according to their path-complexity
- Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
- A New Entropy for Hypergraphs
- The tripartite separability of density matrices of graphs
- A note on the von Neumann entropy of random graphs
- Depth-based complexity traces of graphs
- Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
- Estimating the trace of matrix functions with application to complex networks
- Entanglement and other quantum correlations of a single qudit state
- Multipartite separability of density matrices of graphs
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
- On the spectral properties of Feigenbaum graphs
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- On the degree conjecture for separability of multipartite quantum states
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
- Walk entropies in graphs
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Entangled Graphs
- Quantum discord of states arising from graphs
- The von Neumann entropy of random multipartite graphs
- Graph kernels from the Jensen-Shannon divergence
- Bound entanglement and distillability of multipartite quantum systems
This page was built for publication: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858019)
