Limitations of nearest-neighbour quantum networks
arXiv:2202.10886 · doi:10.1103/PhysRevA.106.L010401
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.
arXiv comment5 pages, 3 figures
References in corpus (20)
- The Quantum Internet
- Measurement-based quantum computation with cluster states
- Quantum Communication Through an Unmodulated Spin Chain
- Multi-party entanglement in graph states
- The European Quantum Technologies Roadmap
- Qubit teleportation between non-neighboring nodes in a quantum network
- Graphical description of the action of local Clifford transformations on graph states
- A Review of Perfect State Transfer and its Application as a Constructive Tool
- Soundness and completeness of quantum root-mean-square errors
- Path Selection for Quantum Repeater Networks
- Quantum network communication -- the butterfly and beyond
- Shortcuts to quantum network routing
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Large-scale quantum networks based on graphs
- Transforming graph states using single-qubit operations
- Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices
- Analysis of Measurement-based Quantum Network Coding over Repeater Networks under Noisy Conditions
- Deterministic preparation of W states via spin-photon interactions
- Transforming graph states to Bell-pairs is NP-Complete
- Classical-quantum network coding: a story about tensor
Cited by in corpus (10)
- 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
- Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks
- 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