Complex networks from classical to quantum
Open accessThe 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
Cites
Statistics
Figures




Verification
Claims the paper makes
76 Valid · 3 Not valid · 12 Not checked · 17 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Rapid experimental progress has pushed quantum computing and communication devices into truly data-intensive domains”
What the sources say
- Could not verifycites [6] Acín, A., Cirac, J. I. & Lewenstein, M. Entanglement percolation in quantum networks. Nat. Phys. 3, 256–259 (2007). This paper discovers several properties of entanglement-based complex quantum networks. sourceExperimental — accuracy not yet measured
The Abstract discusses quantum-network protocols and describes quantum networks as a basis for future communication. It does not say that rapid experimental progress has moved quantum computing or communication devices into data-intensive domains; searches for experimental progress and data complexity found no passage addressing that claim. (LLM, conf=0.73)
- Not matchedcites [7] Faccin, M., Johnson, T., Biamonte, J., Kais, S. & Migdał, P. Degree distribution in quantum walks on complex networks. Phys. Rev. X 3, 041007 (2013).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Partly supportedcites [8] Paparo, G. D. & Martin-Delgado, M. A. Google in a quantum network. Sci. Rep. 2, 444 (2012). sourceExperimental — accuracy not yet measured
The Abstract (page unavailable) reports recent experimental progress and says modest quantum networks have been realized. It does not say that quantum computing and communication devices have entered data-intensive domains; instead, it says a scalable quantum computer is not yet available. The Discussion (page unavailable) says applying the proposed algorithm to very large networks remains future work. (LLM, conf=0.85)
- Could not verifycites [9] Garnerone, S. Thermodynamic formalism for dissipative quantum walks. Phys. Rev. A 86, 032342 (2012). sourceExperimental — accuracy not yet measured
The Introduction (p. 1) describes quantum walks as tools for quantum computation and discusses their use in complex networks, but it does not link experimental progress to data-intensive quantum computing or communication devices. Searches for experimental progress, data-intensive applications, and quantum communication found no passage addressing that claim. (LLM, conf=0.72)
- Not checked — no full text of the sourcecites [10] Paparo, G., Müller, M., Comellas, F. & Martin-Delgado, M. Quantum google algorithm. EPJ Plus 129, 150 (2014). source
- Partly supportedcites [11] Sánchez-Burillo, E., Duch, J., Gómez-Gardeñes, J. & Zueco, D. Quantum navigation and ranking in complex networks. Sci. Rep. 2, 650 (2012). sourceExperimental — accuracy not yet measured
The Discussion (page not available) says that as quantum-network nodes and connections increase, the quantum information community encounters complex network structures. It does not say that rapid experimental progress has already pushed quantum computing and communication devices into data-intensive domains; the paper describes its own quantum-navigation method as implementable without quantum hardware. (LLM, conf=0.79)
- Could not verifycites [12] Lu, D. et al. Chiral Quantum Walks. Phys. Rev. A 93, 0423902 (2016). This paper experimentally realizes chiral quantum walks (walks that direct transport modulated time-symmetry breaking as proposed in [65]. sourceExperimental — accuracy not yet measured
The Introduction describes emerging quantum technologies and a complex-network approach, while the Discussion reports a three-qubit experiment. Neither section says that rapid experimental progress has moved quantum computing or communication devices into data-intensive domains; searches for that claim and for a paradigm shift in complexity found no supporting passage in our copy. (LLM, conf=0.74)
- Could not verifycites [13] Faccin, M., Migdał, P., Johnson, T. H., Bergholm, V. & Biamonte, J. D. Community detection in quantum complex. Netw. Phys. Rev. X 4, 041012 (2014). sourceExperimental — accuracy not yet measured
The Introduction says researchers are exploring quantum networks of increasing size, and the Discussion describes methods suitable for networks with thousands of nodes. Neither passage addresses rapid experimental progress in quantum computing or communication devices, or says those devices have entered data-intensive domains (searched those terms and paraphrases). (LLM, conf=0.74)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“quantum computer algorithms have been proposed to offer enhancement for several network problems”
What the sources say
- Partly supportedcites [8] Paparo, G. D. & Martin-Delgado, M. A. Google in a quantum network. Sci. Rep. 2, 444 (2012). sourceExperimental — accuracy not yet measured
The Abstract reports a quantum PageRank protocol that outperforms its classical counterpart for ranking web pages. But this is one network problem, not several, and the paper says its protocol is designed for a scenario in which no quantum computer is available. The Results section separately mentions a proposed quantum-computer approach to improving PageRank efficiency. (LLM, conf=0.85)
- Partly supportedcites [9] Garnerone, S. Thermodynamic formalism for dissipative quantum walks. Phys. Rev. A 86, 032342 (2012). sourceExperimental — accuracy not yet measured
The Introduction (p. 1) describes quantum walks as useful for algorithm design, and Section IV (p. 3) discusses a quantum analogue of PageRank, a network-ranking problem. These passages support a proposed quantum approach to a network problem, but do not establish enhancement for several network problems. (LLM, conf=0.78)
- Not checked — no full text of the sourcecites [10] Paparo, G., Müller, M., Comellas, F. & Martin-Delgado, M. Quantum google algorithm. EPJ Plus 129, 150 (2014). source
- Partly supportedcites [11] Sánchez-Burillo, E., Duch, J., Gómez-Gardeñes, J. & Zueco, D. Quantum navigation and ranking in complex networks. Sci. Rep. 2, 650 (2012). sourceExperimental — accuracy not yet measured
The Discussion (page not specified) reports that the proposed quantum navigation method improves network ranking, supporting the general idea of a quantum approach enhancing a network task. But it explicitly says the algorithm does not rely on a quantum implementation; our copy does not establish quantum-computer algorithms enhancing several network problems. (LLM, conf=0.86)
plainstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Novel quantum induced effects have been predicted in random graphs -where edges represent entangled links”
What the sources say
- Partly supportedcites [6] Acín, A., Cirac, J. I. & Lewenstein, M. Entanglement percolation in quantum networks. Nat. Phys. 3, 256–259 (2007). This paper discovers several properties of entanglement-based complex quantum networks. sourceExperimental — accuracy not yet measured
The paper’s Abstract (page unavailable) predicts novel entanglement-percolation effects in networks whose connected nodes share entangled states. But it specifies that the networks studied have regularly arranged nodes, including lattices; it does not describe the underlying networks as random graphs. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“The striking result is that it is possible to obtain, with probability approaching unity, a quantum state with the topology of any fi nite subgraph for N approaching in fi nity and z = -2.”
What the sources say
- Could not verifycites [6] Acín, A., Cirac, J. I. & Lewenstein, M. Entanglement percolation in quantum networks. Nat. Phys. 3, 256–259 (2007). This paper discovers several properties of entanglement-based complex quantum networks. sourceExperimental — accuracy not yet measured
The paper discusses entanglement paths in two-dimensional lattices and says their probability can be unity in an infinite network (section labeled Abstract; page unavailable). Our copy does not address obtaining a quantum state with the topology of any finite subgraph, or a condition z = -2; searches for those terms and paraphrases found no such result. (LLM, conf=0.76)
hedgedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“in the case of qubits, it has been shown that the probability of having an entangled path with in fi nite length -i.e., an in fi nite sequence of entangled states connecting an in fi nite number of qubits -is unity.”
What the sources say
- Partly supportedcites [6] Acín, A., Cirac, J. I. & Lewenstein, M. Entanglement percolation in quantum networks. Nat. Phys. 3, 256–259 (2007). This paper discovers several properties of entanglement-based complex quantum networks. sourceExperimental — accuracy not yet measured
The passage labeled Abstract (page unavailable) says that, for two-dimensional lattices of qubits, the probability of an infinitely connected entangled path is unity over a continuous interval of entanglement values. The claim omits those conditions and presents the result as applying to qubits generally; the same passage says the probability is zero for product states. (LLM, conf=0.88)
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
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.
- It may state two separate claims as one. 27
- Probably not a substantial claim. 35
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.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Quantum networks based on entangled states · p. 3
“The probability scales with the size of the network following a power law p ∝ N -z , with z ≥ 0.”
§ Quantum networks based on entangled states · p. 3
“The striking result is that it is possible to obtain, with probability approaching unity, a quantum state with the topology of any fi nite subgraph for N approaching in fi nity and z = -2.”
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 2×
“Building on several fundamental discoveries [14, 15], complex network theory has demonstrated that many (non-quantum) systems exhibit similarities in their complex features [14–18], in the organization of their structure and dynamics [19–24], the controllability of their constituents [25] and their…”
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471 · cited 1×
“Many real world networks have been found to follow a widely heterogeneous distribution of degree values [88].”
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719 · cited 2×
“We refer to [16, 53] for reviews of network concepts and models.”
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“Community detection, and in general mesoscopic structure detection, has been widely studied in the literature of classical complex networks [90, 91].”
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534 · cited 3×
“The development of quantum error correction techniques that make quantum computing and quantum communication possible can not prescind from the study of ‘system resilience’, a topic that found uncountable applications in classical network science [26, 28, 31, 98, 99].”
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023 · cited 2×
“…that are natural for classical systems, such as targeted attacks of network hubs [26] or cascade-based attacks [100], still have no clear quantum counterpart and their study, from both theoretical and experimental perspectives, will play a key role in the development of a quantum Internet [5].”
The Theory of Open Quantum Systems
Breuer, H.-P., & Petruccione, F. (2007) · doi:10.1093/acprof:oso/9780199213900.001.0001 · Cited by 5,938
Approximate entropy as a measure of system complexity.
Pincus, S. M. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.6.2297 · Cited by 5,811
Cited by
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
Quantum walk and its application domains: A systematic review
Kadian, K., Garhwal, S., & Kumar, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100419 · Cited by 203
Complex systems in the spotlight: next steps after the 2021 Nobel Prize in Physics
Bianconi, G., Arenas, À., Biamonte, J., Carr, L. D., Kahng, B., Kertész, J., Kurths, J., Lü, L., Masoller, C., Motter, A. E., et al. (2023) · Journal of Physics Complexity · doi:10.1088/2632-072x/ac7f75 · Cited by 126
Self-citationMachine intelligence in non-invasive endocrine cancer diagnostics
Thomasian, N. M., Kamel, I. R., & Bai, H. X. (2021) · Nature Reviews Endocrinology · doi:10.1038/s41574-021-00543-9 · Cited by 66
“Previous studies 177,178 depicted quantum networks as two nodes with the cutout region between nodes illustrating the induction of dependent quantum states among two particles (A and B, where S refers to a shared source of squeezed light) and this particle ‘entanglement’ is at the crux of quantum…”
BackgroundIdentifying key players in complex networks via network entanglement
Huang, Y., Wang, H., Ren, X.-L., & Lü, L. (2024) · Communications Physics · doi:10.1038/s42005-023-01483-8 · Cited by 56
“A cutting-edge research direction in complex networks is the integration of quantum information theory 15,16 .”
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
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- 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.