The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

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.

20 pages, 11 figures

Cited by in corpus (39)

• Mathematical Formulation of Multi-Layer Networks
• Layer aggregation and reducibility of multilayer interconnected networks
• The Statistical Physics of Real-World Networks
• MuxViz: A Tool for Multilayer Analysis and Visualization of Networks
• Spectral entropies as information-theoretic tools for complex network comparison
• Mapping multiplex hubs in human functional brain network
• The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
• Complex Networks from Classical to Quantum
• Interdisciplinary and physics challenges of Network Theory
• Gibbs entropy of networks ensembles by cavity methods
• Thermodynamic characterization of networks using graph polynomials
• A multilayer PPI network analysis of different life stages in C. elegans
• Representation of texts as complex networks: a mesoscopic approach
• Thermodynamic formalism for dissipative quantum walks
• Bipartite quantum states and random complex networks
• Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs
• Encoding graphs into quantum states: an axiomatic approach
• Bipartite separability and non-local quantum operations on graphs
• Approximate entropy of network parameters
• Randomized Graph States and their Entanglement Properties
• Combinatorial approach to multipartite quantum systems:basic formulation
• Entropy rate of non-equilibrium growing networks
• Entanglement properties of quantum grid states
• A graph theoretical approach to states and unitary operations
• On the spectral properties of Feigenbaum graphs
• A geometric entropy detecting the Erdös-Rényi phase transition
• Thermodynamics of network model fitting with spectral entropies
• On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism
• Quantum discord of states arising from graphs
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity
• New Minkowski type inequalities and entropic inequalities for quantum states of qudits
• Ranking nodes according to their path-complexity
• Asymptotic entropy of the Gibbs state of complex networks
• The von Neumann entropy of networks
• Condition for zero and non-zero discord in graph Laplacian quantum states
• Bound entanglement and distillability of multipartite quantum systems
• Multipartite separability of density matrices of graphs
• Detection of $d_1\otimes d_2$ Dimensional Bipartite Entangled State: A Graph Theoretical Approach
• Quantum Entanglement & Purity Testing: A Graph Zeta Function Perspective