Scholarlink

<p>The entanglement routing algorithm facilitates multi-path communication among users in quantum networks via quantum entanglement. While previous research primarily concentrated on maximizing throughput, practical implementations also necessitate consideration of service rates and quantum resource utilization. This paper presents a novel routing algorithm called Collaboratively Optimized Selection of Paths (COSP) that balances expected throughput, service rate and quantum resource utilization. The COSP algorithm integrates resource efficiency as a novel routing metric alongside the Monte Carlo Tree Search method to optimize resource allocation policies. To address high concurrency and conflicting requests, COSP implements a strategic grouping of user requests coupled with a “fail-retransmit” mechanism to ensure fairness. Simulation results reveal that COSP significantly outperforms traditional greedy resource allocation strategies, boosting handling of high concurrency scenarios by 50%, also significantly improving the service rate by up to 55%.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Advanced Collaborative Routing Algorithm for Optimizing Entanglement and Resource Efficiency in Quantum Networks

  • 期刊论文

  • 发表日期：

    2025年1月11日

查看全文
  • Zhongrui Huang,
  • Hong Lai,
  • Linchun Wan

摘要

The entanglement routing algorithm facilitates multi-path communication among users in quantum networks via quantum entanglement. While previous research primarily concentrated on maximizing throughput, practical implementations also necessitate consideration of service rates and quantum resource utilization. This paper presents a novel routing algorithm called Collaboratively Optimized Selection of Paths (COSP) that balances expected throughput, service rate and quantum resource utilization. The COSP algorithm integrates resource efficiency as a novel routing metric alongside the Monte Carlo Tree Search method to optimize resource allocation policies. To address high concurrency and conflicting requests, COSP implements a strategic grouping of user requests coupled with a “fail-retransmit” mechanism to ensure fairness. Simulation results reveal that COSP significantly outperforms traditional greedy resource allocation strategies, boosting handling of high concurrency scenarios by 50%, also significantly improving the service rate by up to 55%.