Projecte llegit
Títol: Implementación de algoritmos de enrutamiento para redes cuánticas
Estudiants que han llegit aquest projecte:
GARRIDO GONZÁLEZ, MARCO (data lectura: 28-10-2026)- Cerca aquest projecte a Bibliotècnica
GARRIDO GONZÁLEZ, MARCO (data lectura: 28-10-2026)Director/a: AGUSTÍ TORRA, ANNA
Departament: ENTEL
Títol: Implementación de algoritmos de enrutamiento para redes cuánticas
Data inici oferta: 22-12-2025 Data finalització oferta: 22-07-2026
Estudis d'assignació del projecte:
GR ENG SIS TELECOMUN
GR ENG TELEMÀTICA
| Tipus: Individual | |
| Lloc de realització: EETAC | |
| Segon director/a (UPC): JOFRE CRUANYES, MARC | |
| Paraules clau: | |
| Routing, Quantum networks | |
| Descripció del contingut i pla d'activitats: | |
| This project proposes the implementation, testing and validation of routing algorithms using the infrastructure of the 6G-OpenLab (https://6g-openlab.upc.edu/en).
The algorithms to be implemented are routing protocols for quantum networks, which are designed to distribute entangled pairs of quantum bits, also called qubits, to establish end-to-end (E2E) entangled pairs between end nodes. Entanglement is a special connection between quantum states, where their properties are linked together regardless of the distance between them. In classical networks, a routing algorithm must select the best path between endpoints considering metrics such as number of hops, the link costs, or throughput. Path computation to establish E2E quantum entanglements has to consider additional properties inherent to the physical layer, such as the requested quantum fidelity. The objective of this project is to implement, validate, test and compare at least two algorithms defined in the literature, using the resources of a 5G+ cloud infrastructure. A complete explanation of the algorithms' implementation in this system will be mandatory. A detailed presentation of the algorithms' results and their comparison will also be required. |
|
| Overview (resum en anglès): | |
| This project presents the implementation, testing, and validation, within a simulation environment, of routing algorithms for end-to-end quantum resource distribution in quantum networks. The aim is to determine the efficiency of the Q-CAST algorithm in managing resources across the network compared to classical Dijkstra-based variants.
First, an exhaustive search of quantum network simulators capable of implementing routing algorithms was conducted. The simulator selected for this work was the Multiverse Quantum Network Simulator (MQNS), chosen for its architectural flexibility and the realism of its simulations. This work focused on programming and adapting Q-CAST within the MQNS quantum network simulator. A variant of this algorithm utilizing multi-entanglement techniques was proposed to maximize network throughput. Subsequently, to establish a baseline for comparison, classical approaches based on Dijkstra's algorithm (evaluating hop count and physical distance) were developed, incorporating multi-circuit reservation variants. All of these were adapted to operate over the cyclic phase system designed by the developers of Q-CAST to ensure a fair comparison. Finally, a comprehensive explanation of the algorithm's adaptation and implementation within the simulator is provided. Furthermore, a detailed description of the algorithm results and their comparison is included, evaluating metrics such as throughput and fidelity in static scenarios. Additionally, end-to-end entangled pair throughput was evaluated across various quantum network topologies to analyze the scaling capacity of the algorithms used in this work. The results demonstrate that the Q-CAST algorithm exhibits superior performance regarding throughput and fault mitigation in complex networks with high losses. However, under ideal scenario conditions, single-channel Dijkstra variants prove to be more efficient by avoiding resource contention. |
|