Editing Routing Entanglement in the Quantum Internet (section)

==Further Information==
<!-- theoretical and experimental papers including requirements, security proof (important), which protocol does it implement, benchmark values... -->
<!-- to do -->
* [https://arxiv.org/abs/1601.00966 Pirandola (2016)] analyzed entanglement-generation capacities of repeater networks assuming ideal repeater nodes and argued that for a single ﬂow the maximum entanglement-generation rate <math>R_1</math> reduces to the classical max-ﬂow min-cut problem.
* [https://arxiv.org/abs/1606.00135 Azuma and Kato (2016)] looked at an "aggregated" protocol in which the repeater protocols run in parallel.
* [https://arxiv.org/abs/1610.05238 Schoute et al. (2016)] developed routing protocols on speciﬁc network topologies and found scaling laws as functions on the number of qubits in the memories at nodes, and the time and space consumed by the routing algorithms, under lossless and noiseless assumptions.
* [https://arxiv.org/abs/quant-ph/0612167 Acín et al. (2006)] have considered the problem of entanglement percolation where neighboring nodes share a perfect lossless pure state.
There is an extensive literature of quantum networks analyzing repeaters in a linear chain for example:
[https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.81.5932 Briegel et al. (1998)], [https://arxiv.org/abs/0809.3629 Jiand et al. (2008)] and [https://www.nature.com/articles/srep20463 Muralidharan et al. (2016)].