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-3zbMath1106.05057arXivquant-ph/0406165OpenAlexW3100495106MaRDI QIDQ858019
Samuel L. Braunstein, Sibasish Ghosh, Simone Severini
Publication date: 5 January 2007
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0406165
Related Items
Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph ⋮ A graph theoretical approach to states and unitary operations ⋮ Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect ⋮ Bound entanglement and distillability of multipartite quantum systems ⋮ Symmetric Laplacians, quantum density matrices and their von-Neumann entropy ⋮ On the von Neumann entropy of a graph ⋮ A note on the von Neumann entropy of random graphs ⋮ The von Neumann entropy of random multipartite graphs ⋮ Graph kernels from the Jensen-Shannon divergence ⋮ Laplacian matrices of weighted digraphs represented as quantum states ⋮ Depth-based hypergraph complexity traces from directed line graphs ⋮ Separability of density matrices of graphs for multipartite systems ⋮ Estimating the trace of matrix functions with application to complex networks ⋮ Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs ⋮ Depth-based complexity traces of graphs ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods ⋮ Quantum entanglement \& purity testing: a graph zeta function perspective ⋮ Quantum discord of states arising from graphs ⋮ Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics ⋮ Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy ⋮ Walk entropies in graphs ⋮ Bipartite quantum states and random complex networks ⋮ On the degree conjecture for separability of multipartite quantum states ⋮ Multipartite separability of density matrices of graphs ⋮ Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection ⋮ Note on von Neumann and Rényi entropies of a graph ⋮ Concurrence and three-tangle of the graph ⋮ On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism ⋮ Combinatorial entanglement ⋮ Ranking nodes according to their path-complexity ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ A note on the degree conjecture for separability of multipartite quantum states ⋮ A New Entropy for Hypergraphs ⋮ Entanglement and other quantum correlations of a single qudit state ⋮ New Minkowski type inequalities and entropic inequalities for quantum states of qudits ⋮ Entropy of tournament digraphs ⋮ Entanglement and separability of graph Laplacian quantum states ⋮ On the spectral properties of Feigenbaum graphs
