ZBR: Zone-based routing in quantum networks with efficient entanglement distribution

IF 8 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Journal of Network and Computer Applications Pub Date : 2025-03-08 DOI:10.1016/j.jnca.2025.104156
Pankaj Kumar, Binayak Kar
{"title":"ZBR: Zone-based routing in quantum networks with efficient entanglement distribution","authors":"Pankaj Kumar,&nbsp;Binayak Kar","doi":"10.1016/j.jnca.2025.104156","DOIUrl":null,"url":null,"abstract":"<div><div>The quantum network aims to establish connections among multiple quantum nodes, supporting various innovative applications. Many of these applications necessitate the sharing of entangled pairs among communicating parties. However, the inherent nature of entanglement leads to an exponential decrease as the distance between quantum nodes increases. This phenomenon makes it challenging for entangled pairs shared by quantum nodes to fulfill end-to-end entanglement routing requests, resulting in significant communication loss between these nodes. To tackle this challenge, we proposed Zone-Based Routing (ZBR) for quantum networks, which effectively handles end-to-end entanglement distribution. The core concept of zone-based routing involves creating zones containing source and destination pairs to facilitate effective entanglement distribution within each zone. We introduce Zone-Based Path Selection (ZBPS) and Zone-Based Entanglement Purification (ZBEP) algorithms to implement this approach. The main idea of the ZBPS algorithm is to select a routing path based on the flow capacity of adjacent links. Whereas, the ZBEP algorithm focuses on entanglement fidelity purification of the chosen path. These algorithms collectively maintain entanglement distribution, high fidelity, and throughput in quantum networks. Our simulation results demonstrate a significant improvement in entanglement distribution within quantum networks compared to traditional entanglement distribution routing designs.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"238 ","pages":"Article 104156"},"PeriodicalIF":8.0000,"publicationDate":"2025-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804525000530","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The quantum network aims to establish connections among multiple quantum nodes, supporting various innovative applications. Many of these applications necessitate the sharing of entangled pairs among communicating parties. However, the inherent nature of entanglement leads to an exponential decrease as the distance between quantum nodes increases. This phenomenon makes it challenging for entangled pairs shared by quantum nodes to fulfill end-to-end entanglement routing requests, resulting in significant communication loss between these nodes. To tackle this challenge, we proposed Zone-Based Routing (ZBR) for quantum networks, which effectively handles end-to-end entanglement distribution. The core concept of zone-based routing involves creating zones containing source and destination pairs to facilitate effective entanglement distribution within each zone. We introduce Zone-Based Path Selection (ZBPS) and Zone-Based Entanglement Purification (ZBEP) algorithms to implement this approach. The main idea of the ZBPS algorithm is to select a routing path based on the flow capacity of adjacent links. Whereas, the ZBEP algorithm focuses on entanglement fidelity purification of the chosen path. These algorithms collectively maintain entanglement distribution, high fidelity, and throughput in quantum networks. Our simulation results demonstrate a significant improvement in entanglement distribution within quantum networks compared to traditional entanglement distribution routing designs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于区域的高效纠缠分布量子网络路由
量子网络旨在建立多个量子节点之间的连接,支持各种创新应用。许多这样的应用程序需要在通信各方之间共享纠缠对。然而,纠缠的固有性质导致随着量子节点之间距离的增加而呈指数减少。这种现象使得量子节点共享的纠缠对难以满足端到端纠缠路由请求,导致节点间通信损失严重。为了解决这一挑战,我们提出了量子网络的基于区域的路由(ZBR),它有效地处理了端到端纠缠分布。基于区域路由的核心概念包括创建包含源对和目的对的区域,以促进每个区域内有效的纠缠分布。我们引入了基于区域的路径选择(ZBPS)和基于区域的纠缠净化(ZBEP)算法来实现该方法。ZBPS算法的主要思想是根据相邻链路的流量选择路由路径。而ZBEP算法侧重于所选路径的纠缠保真度净化。这些算法共同维护量子网络中的纠缠分布、高保真度和吞吐量。我们的仿真结果表明,与传统的纠缠分布路由设计相比,量子网络中的纠缠分布有了显著的改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Network and Computer Applications
Journal of Network and Computer Applications 工程技术-计算机:跨学科应用
CiteScore
21.50
自引率
3.40%
发文量
142
审稿时长
37 days
期刊介绍: The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.
期刊最新文献
Length field recognition for unknown network protocol in static trace HARVEST: Hardware-Based Ransomware Detection and Stage Tracking for AIoMT Devices Accelerating the consensus speed of complex networked system via reweighting the edges Tree fringe and ridge subgraph-based critical vertex shielding for network resilience improvement LCC: Latency-aware Cross-radio Cooperation for energy-optimized data dissemination in heterogeneous IoT
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1