Limitations of nearest-neighbour quantum networks
Frederik Hahn, Axel Dahlberg, Jens Eisert, Anna Pappa

TL;DR
This paper examines the limitations of nearest-neighbour quantum networks like rings, lines, and grids, showing they cannot resolve common bottleneck issues in multi-partite quantum communication.
Contribution
It provides a critical analysis of nearest-neighbour quantum network architectures, highlighting their fundamental limitations in overcoming bottleneck communication problems.
Findings
Rings and lines cannot overcome bottleneck issues.
Nearest-neighbour networks have inherent limitations.
Quantum routing in these architectures faces fundamental constraints.
Abstract
Quantum communication research has in recent years shifted to include multi-partite networks for which questions of quantum network routing naturally emerge. To understand the potential for multi-partite routing, we focus on the most promising architectures for future quantum networks - those connecting nodes close to each other. Nearest-neighbour 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 here analyze the potential of nearest-neighbour quantum networks and identify some serious limitations, by demonstrating that rings and lines cannot overcome common bottleneck communication problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
