Bipartite quantum states and random complex networks

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 3 figures

Scientific paper

10.1088/1367-2630/14/1/013011

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 $\bar S$ while for general complex networks we rely on numerics. For large number of nodes $n$ we find a scaling $\bar{S} \sim c \log n +g_e$ where both the prefactor $c$ and the sub-leading O(1) term $g_e$ are a characteristic of the different classes of complex networks. In particular, $g_e$ 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bipartite quantum states and random complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bipartite quantum states and random complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite quantum states and random complex networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-569657

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.