Efficient Routing on Quantum Networks using Adaptive Clustering
Connor Clayton, Xiaodi Wu, Bobby Bhattacharjee

TL;DR
QuARC is a clustering-based quantum routing protocol that adaptively reconfigures networks for high-throughput, low-overhead entanglement distribution without prior physical parameter knowledge.
Contribution
Introduces QuARC, a novel adaptive clustering-based entanglement routing protocol for quantum networks that does not require prior physical parameter knowledge.
Findings
Robust against physical network parameter changes
Maintains high throughput at scale
Prevents starvation in entanglement distribution
Abstract
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…
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 Computing Algorithms and Architecture · Complex Network Analysis Techniques · Cloud Computing and Resource Management
