CoChat

Complex networks from classical to quantum

Open access
Biamonte, Jacob, Faccin, Mauro, De Domenico, Manlio · 2019 · Communications Physics

The DOI matches its Crossref record; 112 of the 112 references it cites were found in a registry or an index; 142 of the 185 sources its claims cite were checked for support.

Abstract

Abstract Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial cross-over. 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.

Overview

CoChat Summary

TL;DR

This review surveys the cross-pollination between complex network theory and quantum information science, focusing on quantum networks built from entangled states and on physically connected quantum systems. It argues that network information theory may provide a unified framework for classical and quantum networked systems.

Key findings

  • Two main classes of quantum networks are reviewed: networks whose edges are entangled states, and networks of physically interconnected quantum systems such as atoms or superconducting circuits.
  • In entanglement-based random graphs, replacing links with entangled pairs lets the probability of link existence map to entanglement; LOCC conversion succeeds with optimal probability \(p\), and for \(N \to \infty\) and \(z=-2\), a quantum state with the topology of any finite subgraph can be obtained with probability approaching unity.
  • Quantum PageRank approaches resolve degeneracy issues in classical PageRank, enhance the importance of secondary hubs, and for certain values of \(\alpha\) exhibit faster convergence.
  • Quantum walks on complex networks show key differences from stochastic walks: the stochastic and quantum generators are spectrally similar and share eigenvalues, with eigenvectors related by \(D^{-1/2}\), while a quantumness measure \(\varepsilon\) quantifies departure from classical occupation probabilities.

Methods

  • Review article synthesizing prior theoretical, experimental, and computational work at the intersection of complex networks and quantum information.
  • No dataset was generated or analyzed; the paper states “No data set were generated or analyzed during the current study.”
  • The review is organized around entangled-state quantum networks, physically connected quantum networks, quantum walks and PageRank, and unified information-theoretic analyses of network complexity.

Limitations

  • The authors state that they do not cover several topics, including quantum gravity theories based on complex networks, synchronization in and on quantum networks, quantum random circuits, classical spin models, and quantum statistics used in complex network theory.
  • The authors state that the scale-free quantum network result is a toy model with theoretical predictions still to be verified experimentally, and that the interplay between structure and dynamics in quantum networks is almost entirely unclear.
  • Evident from the text: as a narrative review, it does not report a systematic search strategy or inclusion criteria, and its coverage is explicitly selective rather than exhaustive.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s42005-019-0152-6

Cites

112 of 112 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Image 1
From the PDF
Fig. 1 Entanglement connecting distant network nodes. A pair of distant cavities in a quantum communication network are driven by a shared squeezed light source S . In the systems steady state the two atoms A and B entangle, forming a network edge 34
Fig. 1 Entanglement connecting distant network nodes. A pair of distant cavities in a quantum communication network are driven by a shared squeezed light source S . In the systems steady state the two atoms A and B entangle, forming a network edge 34From the PDF
Fig. 2 Known mappings between quantum and stochastic generators. Here G = ( V , E ) is a graph with adjacency matrix A , D is a diagonal matrix of node degrees. This yields the graph Laplacian L ¼ D  A , and hence, the stochastic walk generator L S ¼ L D  1 , from this a similarity transform results in L Q ¼ D  1 2 L D  1 2 , which generates a valid quantum walk and exhibits several interesting connections to the classical case. The mapping L ! L T L preserves the lowest 0 energy ground state, opening the door for adiabatic quantum annealing, which solves computational problems by evolving a system into its ground state
Fig. 2 Known mappings between quantum and stochastic generators. Here G = ( V , E ) is a graph with adjacency matrix A , D is a diagonal matrix of node degrees. This yields the graph Laplacian L ¼ D A , and hence, the stochastic walk generator L S ¼ L D 1 , from this a similarity transform results in L Q ¼ D 1 2 L D 1 2 , which generates a valid quantum walk and exhibits several interesting connections to the classical case. The mapping L ! L T L preserves the lowest 0 energy ground state, opening the door for adiabatic quantum annealing, which solves computational problems by evolving a system into its ground stateFrom the PDF
Fig. 3 Community detection in a light harvesting network (LHCII) 13 . a Monomeric subunit of the LHCII complex with pigments Chl-a (red) and Chl-b (green) packed in the protein matrix (gray). b Schematic representation of Chl-a and Chl-b in the monomeric subunit, here the labeling follows the usual nomenclature (b601, a602 … ). c Network representation of the pigments in circular layout, colors represent the typical partitioning of the pigments into communities. The widths of the links represent the strength of the couplings | Hij | between nodes. Here, the labels maintain only the ordering (b601 → 1, a602 → 2, … ). d -f Partition of LHCII applying the quantum community detection algorithm in ref. 13 . Transport (for long times) and Fidelity approaches give similar results, whereas short time transport is closer to classical community detection. Link width denotes the pairwise closeness of the nodes
Fig. 3 Community detection in a light harvesting network (LHCII) 13 . a Monomeric subunit of the LHCII complex with pigments Chl-a (red) and Chl-b (green) packed in the protein matrix (gray). b Schematic representation of Chl-a and Chl-b in the monomeric subunit, here the labeling follows the usual nomenclature (b601, a602 … ). c Network representation of the pigments in circular layout, colors represent the typical partitioning of the pigments into communities. The widths of the links represent the strength of the couplings | Hij | between nodes. Here, the labels maintain only the ordering (b601 → 1, a602 → 2, … ). d -f Partition of LHCII applying the quantum community detection algorithm in ref. 13 . Transport (for long times) and Fidelity approaches give similar results, whereas short time transport is closer to classical community detection. Link width denotes the pairwise closeness of the nodesFrom the PDF

Verification

Claims the paper makes

76 Valid · 3 Not valid · 12 Not checked · 17 Own results and interpretations

45 more claims · 37 with their cited sources checked

Create a free account to see all 108 claims and to verify the 3 references still open.

See all claims — free account
  • It may state two separate claims as one. 27
  • Probably not a substantial claim. 35

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 112 references

Cited by

See all 149

Metadata

Authors
Biamonte, J., Faccin, M., & De Domenico, M.
Affiliations
  • Skolkovo Institute of Science and Technology (RU)
  • UCLouvain (BE)
Corresponding author
  • Biamonte, Jacob
  • Faccin, Mauro
Venue
Communications Physics
Published
2019-05-21
Volume
2
Issue
1
ISSN
2399-3650 (ISSN-L)
OpenAlex
W2593971698
Cited by
149
References
101
Citations by year
2026: 10 · 2025: 17 · 2024: 22 · 2023: 26 · 2022: 24 · 2021: 29 · 2020: 12 · 2019: 5
FWCI
8.10
Type
journal article
Language
en
Open access
Licence
Locations
  • Communications Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (acceptedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • Padua Research Archive (University of Padova) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • Foundational Questions Institute (FQXi-RFP3-1322)
  • University of Waterloo
  • Institut Périmètre de physique théorique
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
Keywords
complex networks, quantum information, entanglement, random graphs, quantum transport, information physics, complex systems, quantum algorithms, entanglement network

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complex networks from classical to quantum. https://app.cochat.ai/papers/10.1038/s42005-019-0152-6
The paper
Biamonte, J., Faccin, M., & De Domenico, M. (2019). Complex networks from classical to quantum. Communications Physics. https://doi.org/10.1038/s42005-019-0152-6

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.