Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity

A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between. This paper tackles the problem of quantum entanglement distribution by solving the routing problem over an infrastructure b...

Full description

Bibliographic Details
Main Authors: Sara Santos, Francisco A. Monteiro, Bruno C. Coutinho, Yasser Omar
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Quantum networks
quantum repeaters
path-finding algorithm
end-to-end fidelity
multi-objective routing
Online Access:https://ieeexplore.ieee.org/document/10019283/

Internet

https://ieeexplore.ieee.org/document/10019283/

Similar Items