Proposes three routing algorithms for quantum networks in continuous and on-demand models that reduce latency versus classical greedy routing in ring and grid topologies, with analytical bounds on swaps.
One can find the detailed proofs of the bounds in the second row of the table II in appendix C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Routing in a Quantum Internet
Proposes three routing algorithms for quantum networks in continuous and on-demand models that reduce latency versus classical greedy routing in ring and grid topologies, with analytical bounds on swaps.