Bipartite quantum states and random complex networks
arXiv:1103.5989 · doi:10.1088/1367-2630/14/1/013011
Abstract
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs we derive an analytic expression for the averaged entanglement entropy while for general complex networks we rely on numerics. For large number of nodes we find a scaling where both the prefactor and the sub-leading O(1) term are a characteristic of the different classes of complex networks. In particular, encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool in the analysis of large complex networks with non-trivial topological properties.
4 pages, 3 figures
References in corpus (4)
Cited by in corpus (15)
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Interdisciplinary and physics challenges of Network Theory
- Quantum synchronization and quantum state sharing in irregular complex network
- Complex Quantum Network Geometries: Evolution and Phase Transitions
- Complex Quantum Networks: a Topical Review
- The topological Dirac equation of networks and simplicial complexes
- Entropy distribution and condensation in random networks with a given degree distribution
- Supersymmetric multiplex networks described by coupled Bose and Fermi statistics
- Phase transition of light on complex quantum networks
- Thermodynamic formalism for dissipative quantum walks
- Encoding graphs into quantum states: an axiomatic approach
- Bipartite separability and non-local quantum operations on graphs
- Information sharing in Quantum Complex Networks
- Quantum entropy couples matter with geometry
- Thermal state entanglement entropy on a quantum graph