The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
From MaRDI portal
Publication:858019
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.
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
(45)- Incremental measurement of structural entropy for dynamic graphs
- Entangled Graphs
- Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices
- Quantum entanglement \& purity testing: a graph zeta function perspective
- Network-ensemble comparisons with stochastic rewiring and von Neumann entropy
- Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods
- Bipartite quantum states and random complex networks
- Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect
- On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
- Walk entropies in graphs
- New Minkowski type inequalities and entropic inequalities for quantum states of qudits
- Concurrence and three-tangle of the graph
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- The tripartite separability of density matrices of graphs
- Depth-based hypergraph complexity traces from directed line graphs
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
- Estimating the trace of matrix functions with application to complex networks
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
- Separability of density matrices of graphs for multipartite systems
- Bound entanglement and distillability of multipartite quantum systems
- On the von Neumann entropy of a graph
- Combinatorial entanglement
- The von Neumann entropy of random multipartite graphs
- Depth-based complexity traces of graphs
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- A new entropy for hypergraphs
- Graph kernels from the Jensen-Shannon divergence
- Ranking nodes according to their path-complexity
- A note on the degree conjecture for separability of multipartite quantum states
- Entanglement and separability of graph Laplacian quantum states
- Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
- Laplacian matrices of weighted digraphs represented as quantum states
- On the degree conjecture for separability of multipartite quantum states
- A note on the von Neumann entropy of random graphs
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Multipartite separability of density matrices of graphs
- Entanglement and other quantum correlations of a single qudit state
- On the spectral properties of Feigenbaum graphs
- Entropy of tournament digraphs
- Note on von Neumann and Rényi entropies of a graph
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
- A graph theoretical approach to states and unitary operations
- Quantum discord of states arising from graphs
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)
