# Complex Networks from Classical to Quantum

arXiv: https://arxiv.org/abs/1702.08459 · HTML: https://mlsanity.com/paper/1702.08459/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Feb 2017.

## Built on by (most cited first, 4 of 4)

- [MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs](https://mlsanity.com/paper/2110.07570/) (2021)
- [Structural Balance and Random Walks on Complex Networks with Complex Weights](https://mlsanity.com/paper/2307.01813/) (2023)
- [Energy-dependent barren plateau in bosonic variational quantum circuits](https://mlsanity.com/paper/2305.01799/) (2023)
- [Cross-Backend QIEO: Universal Runtime Portability across OpenMP5, CUDA, HIP, and Multi-Language Interfaces](https://mlsanity.com/paper/2609.30914/) (2026)

## Abstract (arXiv)

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.