Editing Entanglement Routing (section)

==Further Information==
<!-- Any issue that could not be addressed or find a place in the above sections or any review paper discussing a feature of various types of protocols related to the functionality. -->
All of the approaches below were based on the specific structure of the physical graphs and manipulation of multi-partite entangled states. However, with current day technologies, these solutions are very difficult to realize in practice.

* Distributing entanglement in a simple chain network:
** For a review: [https://ieeexplore.ieee.org/document/7010905 Munro et al. (2015)]
** [https://arxiv.org/abs/0705.4128 Meter et al. (2009)]
** [https://arxiv.org/abs/0808.2972 Goebel et al. (2008)]
** [https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.81.5932 Briegel et al. (1998)]

* Distributing entanglement from a percolation theory point of view:
** [https://arxiv.org/abs/1209.5303 Perseguers et al. (2013)]
** [https://www.nature.com/articles/nphys549 Acín et al. (2007)]
** [https://arxiv.org/abs/0906.1622 Broadfoot et al. (2009)]

* Distributing Entanglements in a noisy network using the concept of quantum network coding:
<!-- ** [https://arxiv.org/abs/0807.0208 Perseguers et al. (2008)] -->
** [https://arxiv.org/abs/0910.4074 Fowler et al. (2010)]
** [https://arxiv.org/abs/0910.1459 Perseguers (2010)]
** [https://arxiv.org/abs/1202.4077 Cavalcanti and Kwek (2012)]
** [https://arxiv.org/abs/1202.1016 Mazurek et al. (2014)]

The routing approaches below are based on classical techniques and these are arguably more likely to be implemented with the near future quantum technology.
In all of these approaches, first, the nodes discover a path from a source to a destination and then distribute the entangled links along the path. The difference between these approaches comes from the path selection algorithms.
* [https://ieeexplore.ieee.org/document/8068178 Caleffi (2017)]
* [https://arxiv.org/abs/1801.02020 Gyongyosi and Imre (2018)]
* [https://arxiv.org/abs/1206.5655 Meter et al. (2013)]
* [https://arxiv.org/abs/1610.05238 Schoute et al. (2016)]

Example of optimization metrics of Entanglement Routing Protocols:
* In [[Routing Entanglement in the Quantum Internet]] their goal is to maximize the rate regions simultaneously achievable by the entanglement flows
* In [[Distributed Routing in a Quantum Internet]] their objective is to minimize the latency of the network to serve a request to create entanglement between two distant nodes in the network.
* In [https://ieeexplore.ieee.org/document/9210823 Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach - Chakraborty et al. (2020)] they consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs.

Other Works:
* In [https://arxiv.org/abs/1601.00966 Capacities of repeater-assisted quantum communications - 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.
* In [https://arxiv.org/abs/1510.08863 Fundamental Limits of Repeaterless Quantum Communications - Pirandola et al. (2015)] provides precise and general benchmarks for quantum repeaters.