# Complex Networks from Classical to Quantum

**Authors:** Jacob Biamonte, Mauro Faccin, Manlio De Domenico

arXiv: 1702.08459 · 2019-05-22

## TL;DR

This paper reviews the intersection of complex network theory and quantum information, highlighting recent advances, novel quantum effects in networks, and quantum algorithm applications for network problems.

## Contribution

It provides a comprehensive overview of how complex network methods are applied to quantum information problems and discusses new quantum-induced effects and algorithms.

## Key findings

- Quantum effects predicted in entangled random graphs
- Quantum algorithms proposed for network problem enhancement
- Insights into similarities and differences between classical and quantum networks

## Abstract

Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information physics is setting the stage for a theory of complex systems with quantum information-inspired methods. Novel quantum induced effects have been predicted in random graphs---where edges represent entangled links---and quantum computer algorithms have been proposed to offer enhancement for several network problems. Here we review the results at the cutting edge, pinpointing the similarities and the differences found at the intersection of these two fields.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1702.08459/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1702.08459/full.md

## References

106 references — full list in the complete paper: https://tomesphere.com/paper/1702.08459/full.md

---
Source: https://tomesphere.com/paper/1702.08459