Limitations of nearest-neighbor quantum networks
F. Hahn (Freie Universität Berlin, Technical University of Berlin)
E.A. Dahlberg (TU Delft - QuTech Advanced Research Centre, TU Delft - QID/Wehner Group)
Jens Eisert (Fraunhofer Heinrich Hertz Institute, Berlin, Freie Universität Berlin)
A. Pappa (Fraunhofer Institute for Open Communication Systems-FOKUS, Berlin, Technical University of Berlin)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Quantum communication research has in recent years shifted to include multipartite networks for which questions of quantum network routing naturally emerge. To understand the potential for multipartite routing, we focus on the most promising architectures for future quantum networks-those connecting nodes close to each other. Nearest-neighbor networks, such as rings, lines, and grids, have been studied under different communication scenarios to facilitate the sharing of quantum resources especially in the presence of bottlenecks. We analyze the potential of nearest-neighbor entangling gate quantum networks and identify some serious limitations by demonstrating that rings and lines cannot overcome common bottleneck communication problems.