Cost vector analysis & multi-path entanglement routing in quantum networks
Abstract
We present a static framework for analysing quantum routing protocols that we call the \textit{cost-vector formalism}. Here, quantum networks are recast as multi-graphs where edges represent two-qubit entanglement resources that \textit{could} exist under some sequence of operations. Each edge is weighted with a \textit{transmission probability} that represents the likelihood of the pair existing and a \textit{coherence probability} which is the likelihood that the pair is suitable for teleportation. Routing operations such as entanglement swapping and purification are then interpreted as \textit{contractions on the multi-graph} with relatively simple rules for updating the edge-weights. Moreover, we extend our formalism to include routing scenarios over time by developing a compatible resource theory for quantum memories. We develop rudimentary greedy algorithms for routing in this framework and test them over a variety of toy networking scenarios. Our results indicate that congestion in quantum networks does not improve significantly when more nodes (computers) are added. Rather, we find that congestion is all but eliminated by waiting a small amount of time.
Cite
@article{arxiv.2105.00418,
title = {Cost vector analysis & multi-path entanglement routing in quantum networks},
author = {Hudson Leone and Nathaniel R. Miller and Deepesh Singh and Nathan K. Langford and Peter P. Rohde},
journal= {arXiv preprint arXiv:2105.00418},
year = {2025}
}
Comments
We identified issues with this version (major and minor) that, regrettably, have not been corrected with full consensus. Due to the uncertain future of this project, we are withdrawing the latest version for academic honesty. A primary concern is section IV, which is disputed by two of the authors. 400 characters is insufficient for describing all issues. For questions, contact Dr. Langford