Editing Distributing Graph States Over Arbitrary Quantum Networks (section)

==Further Information==
The distribution of multipartite entangled states over quantum networks has also been studied in the following articles:
* [http://dx.doi.org/10.1088/1367-2630/18/5/053036 Epping et all (2016)] Investigate the creation of a graph state presenting the shape of the network in the presence of noise.
* [http://dx.doi.org/10.1103/PhysRevA.86.042304 Cuquet and Calsamiglia (2012)] and [http://dx.doi.org/10.1103/PhysRevLett.104.050501 Matsuzaki et al (2010)] Present decomposition of graph states into various building blocks that can be purified and merged to construct graph states over a network.
* [http://dx.doi.org/10.1038/s41534-019-0191-6 Hahn et all (2019)] Studies the possible transformations of an already shared graph-state, with a single-qubit per location.
* [http://dx.doi.org/10.1088/1367-2630/ab05f7 Pirker and Dür (2019)] Includes a protocol very similar to the one presented in this page, but the modeling of the network is different, as well as the optimized metrics. They describe a hierarchical network stack and use it to provide robustness against router or sub-network failures, which is not presented in this work.