Efficient Routing on Quantum Networks Using Adaptive Clustering
We introduce QuARC, Quantum Adaptive Routing using Clusters, a novel clustering-based entanglement routing protocol that leverages redundant, multi-path routing through multi-particle projective quantum measurements to enable high-throughput, low-overhead, starvation-free entanglement distribution. At its core, QuARC periodically reconfigures the underlying quantum network into clusters of different sizes, where each cluster acts as a small network that distributes entanglement across itself, and the end-to-end entanglement is established by further distributing between clusters. QuARC does not require a-priori knowledge of any physical parameters, and is able to adapt the network configuration using static topology information, and using local (within-cluster) measurements only. We present a comprehensive simulation-based evaluation that shows QuARC is robust against changes to physical network parameters, and maintains high throughput without starvation even as network sizes scale and physical parameters degrade.
Authors
- Connor Clayton (ORCID: https://orcid.org/0000-0003-2395-2090)
- Bobby Bhattacharjee
- Xiaodi Wu (ORCID: https://orcid.org/0000-0001-8877-9802)
Institutions
- University of Maryland, College Park (US)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/icnp61940.2024.10858533
- Citations
- 4
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 1.39