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

IF 7.7 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":7.7000,"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好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
A MLOps architecture for near real-time distributed Stream Learning operation deployment Comprehensive phishing detection: A multi-channel approach with variants TCN fusion leveraging URL and HTML features CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning Tensor-based ranking-hiding privacy-preserving scheme for cloud-fog-edge cooperative cyber–physical-social systems ZBR: Zone-based routing in quantum networks with efficient entanglement distribution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1