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...
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: | |
Online Access: | https://ieeexplore.ieee.org/document/10019283/ |
Similar Items
-
A Best-Path Approach to the Design of a Hybrid Space–Ground Quantum Network with Dynamic Constraints
by: David L. Bakker, et al.
Published: (2024-03-01) -
Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing
by: Esra'a Alhenawi, et al.
Published: (2023-01-01) -
Multi-Criteria Path Finding Using Multi-Queues Based Bidirectional Search for Multiple Target Nodes in Networks
by: Xiaoqing Xu, et al.
Published: (2023-01-01) -
NEURAL NETWORK-BASED METHODS FOR FINDING THE SHORTEST PATH and establishing associative connections between objects
by: Eugene Fedorov, et al.
Published: (2023-05-01) -
Entanglement of Signal Paths via Noisy Superconducting Quantum Devices
by: Wenbo Shi, et al.
Published: (2023-01-01)