Quantum random networks

Quantum mechanics offers new possibilities to process and transmit information. In recent years, algorithms and cryptographic protocols exploiting the superposition principle and the existence of entangled states have been designed. They should allow us to realize communication and computational tasks that outperform any classical strategy. Here we show that quantum mechanics also provides fresh perspectives in the field of random networks. Already the simplest model of a classical random graph changes markedly when extended to the quantum case, where we obtain a distinct behaviour 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 N^-2. This result also opens up new vistas in the domain of quantum networks and their applications.