Limitations of nearest-neighbour quantum networks

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.

5 pages, 3 figures

References in corpus (6)

• The Quantum Internet
• Multi-party entanglement in graph states
• Qubit teleportation between non-neighboring nodes in a quantum network
• Shortcuts to quantum network routing
• Deterministic preparation of W states via spin-photon interactions
• Classical-quantum network coding: a story about tensor

Cited by in corpus (9)

• Conference key agreement in a quantum network
• Influence of noise in entanglement-based quantum networks
• Extracting GHZ states from linear cluster states
• Certifying the Topology of Quantum Networks: Theory and Experiment
• Imperfect quantum networks with tailored resource states
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• Multicast quantum network coding as optimal symmetric universal cloning over a quantum network
• Covering a Graph with Minimal Local Sets
• Topology-Dependent Enhancement of Entanglement Extraction in Repeater Graph States