Quantum complex networks
S. Perseguers, M. Lewenstein, A. Ac\'in, J. I. Cirac

TL;DR
This paper explores how quantum physics fundamentally alters the behavior of complex networks, enabling the generation of quantum subgraphs through local operations and classical communication with specific entanglement scaling.
Contribution
It introduces the concept that quantum complex networks exhibit distinct properties from classical ones, especially regarding subgraph emergence and entanglement requirements.
Findings
Quantum networks show different critical probabilities for subgraph appearance.
Any quantum subgraph can be generated with entanglement scaling as 1/N^2.
Quantum effects fundamentally change classical network behaviors.
Abstract
In recent years, new algorithms and cryptographic protocols based on the laws of quantum physics have been designed to outperform classical communication and computation. We show that the quantum world also opens up new perspectives in the field of complex networks. Already the simplest model of a classical random network changes dramatically when extended to the quantum case, as we obtain a completely distinct behavior of the critical probabilities at which different subgraphs appear. In particular, in a network of N nodes, any quantum subgraph can be generated by local operations and classical communication if the entanglement between pairs of nodes scales as 1/N^2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
