Capacity requirements in networks of quantum repeaters and terminals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Capacity requirements in networks of quantum repeaters and terminals

Résumé

We consider the problem of path congestion avoidance in networks of quantum repeaters and terminals. In other words, the avoidance of situations when demands exceed capacity. We assume networks in which the sets of complete paths between terminals may affect the capacity of repeaters in the network. We compare the reduction of congestion avoidance of two representative path establishment algorithms: shortest-path establishment vs. layer-peeling path establishment. We observe that both strategies provide an equivalent entanglement rate, while the layer-peeling establishment algorithm considerably reduces the congestion in the network of repeaters. Repeaters in the inner layers get less congested and require a lower number of qubits, while providing a similar entanglement rate.
Fichier non déposé

Dates et versions

hal-03125753 , version 1 (29-01-2021)

Identifiants

Citer

Michel Barbeau, Joaquin Garcia-Alfaro, Evangelos Kranakis. Capacity requirements in networks of quantum repeaters and terminals. QCE 2020: IEEE International Conference on Quantum Computing and Engineering, Oct 2020, Denver (online), United States. pp.148-157, ⟨10.1109/QCE49297.2020.00028⟩. ⟨hal-03125753⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More