Optimal entanglement distribution within a multi-ring topology

Abstract Entanglement distribution networks are essential for enabling secure, reliable, and sustained communication through the future Quantum Internet. Multi-ring network topologies offer improved scalability and redundancy, but also introduce additional routing complexity for the task of efficien...

Full description

Saved in:
Bibliographic Details
Main Authors: B. C. Ciobanu, T. A. Calafeteanu, A. B. Popa, R. Tătăroiu, P. G. Popescu
Format: Article
Language:English
Published: Nature Portfolio 2025-05-01
Series:Scientific Reports
Online Access:https://doi.org/10.1038/s41598-025-00391-x
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849326831364210688
author B. C. Ciobanu
T. A. Calafeteanu
A. B. Popa
R. Tătăroiu
P. G. Popescu
author_facet B. C. Ciobanu
T. A. Calafeteanu
A. B. Popa
R. Tătăroiu
P. G. Popescu
author_sort B. C. Ciobanu
collection DOAJ
description Abstract Entanglement distribution networks are essential for enabling secure, reliable, and sustained communication through the future Quantum Internet. Multi-ring network topologies offer improved scalability and redundancy, but also introduce additional routing complexity for the task of efficiently distributing entanglement. This paper solves the problem of optimal entanglement distribution in multi-ring quantum network topologies. Two separate multi-ring network configurations are analyzed, one where requests can only be routed within a single ring layer, and involves a less complex node setup, and one where requests may switch ring layers when passing through the network’s nodes, at the cost of additional complexity within the nodes themselves. We propose algorithms that solve the problem of entanglement distribution in terms of optimal time needed to satisfy a set of entanglement resupply requests with given network resources, as well as the problem of optimal resources in order to satisfy a set of entanglement resupply requests within a single entanglement transmission and measurement step. We provide a comprehensive analysis of the proposed algorithms through computer simulations, which indicate that the additional complexity of a network which allows switching between ring layers brings little benefit in terms of time to serve requests, but may reduce the number of resources needed to satisfy the entanglement distribution requests in a non-blocking manner.
format Article
id doaj-art-6d64e7506c38437bb6edcebc8c26ef2d
institution Kabale University
issn 2045-2322
language English
publishDate 2025-05-01
publisher Nature Portfolio
record_format Article
series Scientific Reports
spelling doaj-art-6d64e7506c38437bb6edcebc8c26ef2d2025-08-20T03:48:02ZengNature PortfolioScientific Reports2045-23222025-05-0115111810.1038/s41598-025-00391-xOptimal entanglement distribution within a multi-ring topologyB. C. Ciobanu0T. A. Calafeteanu1A. B. Popa2R. Tătăroiu3P. G. Popescu4Computer Science and Engineering Department, National University of Science and Technology POLITEHNICA BucharestComputer Science and Engineering Department, National University of Science and Technology POLITEHNICA BucharestComputer Science and Engineering Department, National University of Science and Technology POLITEHNICA BucharestComputer Science and Engineering Department, National University of Science and Technology POLITEHNICA BucharestComputer Science and Engineering Department, National University of Science and Technology POLITEHNICA BucharestAbstract Entanglement distribution networks are essential for enabling secure, reliable, and sustained communication through the future Quantum Internet. Multi-ring network topologies offer improved scalability and redundancy, but also introduce additional routing complexity for the task of efficiently distributing entanglement. This paper solves the problem of optimal entanglement distribution in multi-ring quantum network topologies. Two separate multi-ring network configurations are analyzed, one where requests can only be routed within a single ring layer, and involves a less complex node setup, and one where requests may switch ring layers when passing through the network’s nodes, at the cost of additional complexity within the nodes themselves. We propose algorithms that solve the problem of entanglement distribution in terms of optimal time needed to satisfy a set of entanglement resupply requests with given network resources, as well as the problem of optimal resources in order to satisfy a set of entanglement resupply requests within a single entanglement transmission and measurement step. We provide a comprehensive analysis of the proposed algorithms through computer simulations, which indicate that the additional complexity of a network which allows switching between ring layers brings little benefit in terms of time to serve requests, but may reduce the number of resources needed to satisfy the entanglement distribution requests in a non-blocking manner.https://doi.org/10.1038/s41598-025-00391-x
spellingShingle B. C. Ciobanu
T. A. Calafeteanu
A. B. Popa
R. Tătăroiu
P. G. Popescu
Optimal entanglement distribution within a multi-ring topology
Scientific Reports
title Optimal entanglement distribution within a multi-ring topology
title_full Optimal entanglement distribution within a multi-ring topology
title_fullStr Optimal entanglement distribution within a multi-ring topology
title_full_unstemmed Optimal entanglement distribution within a multi-ring topology
title_short Optimal entanglement distribution within a multi-ring topology
title_sort optimal entanglement distribution within a multi ring topology
url https://doi.org/10.1038/s41598-025-00391-x
work_keys_str_mv AT bcciobanu optimalentanglementdistributionwithinamultiringtopology
AT tacalafeteanu optimalentanglementdistributionwithinamultiringtopology
AT abpopa optimalentanglementdistributionwithinamultiringtopology
AT rtataroiu optimalentanglementdistributionwithinamultiringtopology
AT pgpopescu optimalentanglementdistributionwithinamultiringtopology