Researchers have introduced Fidelity-Aware Routing for Entanglement, known as FARE, an entanglement routing protocol designed specifically for small-scale quantum networks. The proposed protocol addresses routing challenges in quantum network communication by executing decentralized path selection based on local link-state information and real-time measurements. This approach eliminates the requirement for a-priori physical parameters as well as the need for global cluster reconfiguration across the network.
To determine paths through the network, the FARE protocol implements a multi-metric cost function that systematically prioritizes high-probability routes. By prioritizing these specific routes, the protocol enables dynamic virtual cluster formation for each source-destination pair.
The performance of the proposed protocol was evaluated through network simulations that compared FARE directly against existing quantum routing protocols. The resulting simulation data showed that FARE reduces control overhead by 72 to 81 percent compared to existing protocols, while simultaneously maintaining competitive throughput across the evaluated quantum networking scenarios.
In latency comparisons, the protocol demonstrated substantially lower latency than the QuARC protocol and achieved latency comparable to Q-CAST. In addition to these latency characteristics, simulation results revealed that FARE reduced starvation rates by approximately 99 percent, addressing the issue of node starvation during entanglement distribution across small-scale quantum networks.
Based on these simulation results, the researchers position FARE as a balanced routing approach tailored for resource-constrained quantum networks. The authors conclude that the protocol successfully addresses the inherent trade-offs between throughput, latency, and starvation in quantum routing, offering an effective decentralized method for entanglement distribution in small-scale environments.
Subject of Research: Entanglement routing protocols for small-scale quantum networks
Article Title: Entanglement Routing Protocol for Small-Scale Quantum Networks
Article References: Appiah, B., Commey, D., Dwumfour, A., Akrong, G. B., Boakye-Sekyerehene, P., & Owusu, E. (2027). Entanglement Routing Protocol for Small-Scale Quantum Networks. Journal of Network and Systems Management, 35(1), Article 2. https://doi.org/10.1007/s10922-026-10102-0
Image Credits: AI Generated
DOI: 10.1007/s10922-026-10102-0
Keywords: quantum networks, entanglement routing, FARE protocol, decentralized routing, link-state information, multi-metric cost function, virtual cluster formation, control overhead, network throughput, routing latency, starvation rate, QuARC, Q-CAST, small-scale quantum networks, resource-constrained networks, path selection, quantum routing trade-offs
News Source: Katie Riggs. (November 21, 2026). Simulations Show FARE Protocol Reduces Control Overhead in Small-Scale Quantum Networks. Scienmag.



