Purification scheduling control for throughput maximization in quantum networks

IF 5.4 1区 物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY
Zirui Xiao, Jian Li, Kaiping Xue, Nenghai Yu, Ruidong Li, Qibin Sun, Jun Lu
{"title":"Purification scheduling control for throughput maximization in quantum networks","authors":"Zirui Xiao, Jian Li, Kaiping Xue, Nenghai Yu, Ruidong Li, Qibin Sun, Jun Lu","doi":"10.1038/s42005-024-01796-2","DOIUrl":null,"url":null,"abstract":"Quantum networks can establish End-to-End (E2E) entanglement connections between two arbitrary nodes with desired entanglement fidelity by performing entanglement purification to support quantum applications reliably. The existing works mainly focus on link-level purification scheduling and lack consideration of purifications at network-level, which fails to offer an effective solution for concurrent requests, resulting in low throughput. However, efficiently allocating scarce resources to purify entanglement for concurrent requests remains a critical but unsolved problem. To address this problem, we explore the purification resource scheduling problem from a network-level perspective. We analyze the cost of purification, design the E2E fidelity calculation method in detail, and propose an approach called Purification Scheduling Control (PSC). The basic idea of PSC is to determine the appropriate purification through jointly optimizing purification and resource allocation processes based on conflict avoidance. We conduct extensive experiments that show that PSC can maximize throughput under the fidelity requirement. In quantum networks, entanglement purification is required to ensure that the E2E fidelity of the entanglement connections can support quantum applications reliably. Here, the authors explore the purification resource scheduling problem from a network-level perspective by jointly optimizing purification and resource allocation processes to maximize the throughput under the fidelity requirement.","PeriodicalId":10540,"journal":{"name":"Communications Physics","volume":" ","pages":"1-8"},"PeriodicalIF":5.4000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.nature.com/articles/s42005-024-01796-2.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications Physics","FirstCategoryId":"101","ListUrlMain":"https://www.nature.com/articles/s42005-024-01796-2","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Quantum networks can establish End-to-End (E2E) entanglement connections between two arbitrary nodes with desired entanglement fidelity by performing entanglement purification to support quantum applications reliably. The existing works mainly focus on link-level purification scheduling and lack consideration of purifications at network-level, which fails to offer an effective solution for concurrent requests, resulting in low throughput. However, efficiently allocating scarce resources to purify entanglement for concurrent requests remains a critical but unsolved problem. To address this problem, we explore the purification resource scheduling problem from a network-level perspective. We analyze the cost of purification, design the E2E fidelity calculation method in detail, and propose an approach called Purification Scheduling Control (PSC). The basic idea of PSC is to determine the appropriate purification through jointly optimizing purification and resource allocation processes based on conflict avoidance. We conduct extensive experiments that show that PSC can maximize throughput under the fidelity requirement. In quantum networks, entanglement purification is required to ensure that the E2E fidelity of the entanglement connections can support quantum applications reliably. Here, the authors explore the purification resource scheduling problem from a network-level perspective by jointly optimizing purification and resource allocation processes to maximize the throughput under the fidelity requirement.

Abstract Image

Abstract Image

实现量子网络吞吐量最大化的净化调度控制
量子网络可以通过执行纠缠净化,在两个任意节点之间建立端到端(E2E)纠缠连接,并达到所需的纠缠保真度,从而可靠地支持量子应用。现有研究主要关注链路级净化调度,缺乏对网络级净化的考虑,无法为并发请求提供有效的解决方案,导致吞吐量较低。然而,有效分配稀缺资源以净化并发请求的纠缠仍是一个关键但尚未解决的问题。为了解决这个问题,我们从网络层面的角度探讨了净化资源调度问题。我们分析了净化的成本,详细设计了 E2E 保真度计算方法,并提出了一种称为净化调度控制(PSC)的方法。PSC 的基本思想是在避免冲突的基础上,通过联合优化净化和资源分配过程来确定适当的净化。我们进行了大量实验,结果表明 PSC 可以在保真度要求下最大限度地提高吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Communications Physics
Communications Physics Physics and Astronomy-General Physics and Astronomy
CiteScore
8.40
自引率
3.60%
发文量
276
审稿时长
13 weeks
期刊介绍: Communications Physics is an open access journal from Nature Research publishing high-quality research, reviews and commentary in all areas of the physical sciences. Research papers published by the journal represent significant advances bringing new insight to a specialized area of research in physics. We also aim to provide a community forum for issues of importance to all physicists, regardless of sub-discipline. The scope of the journal covers all areas of experimental, applied, fundamental, and interdisciplinary physical sciences. Primary research published in Communications Physics includes novel experimental results, new techniques or computational methods that may influence the work of others in the sub-discipline. We also consider submissions from adjacent research fields where the central advance of the study is of interest to physicists, for example material sciences, physical chemistry and technologies.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信