Networking quantum networks with minimum cost aggregation

IF 6.6 1区 物理与天体物理 Q1 PHYSICS, APPLIED npj Quantum Information Pub Date : 2025-03-21 DOI:10.1038/s41534-025-01000-5
Koji Azuma
{"title":"Networking quantum networks with minimum cost aggregation","authors":"Koji Azuma","doi":"10.1038/s41534-025-01000-5","DOIUrl":null,"url":null,"abstract":"<p>A quantum version of an internet, called a quantum internet, holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient distribution of entanglement—entangled bits (ebits)—between arbitrary clients in a quantum network with error bounded by a constant, irrespective of their distance. In practice, this should be accomplished across multiple self-organising quantum networks, analogously to what the current internet does in conventional communication. Here we present a practical recipe on how to efficiently give arbitrary clients ebits with error bounded by a constant, regardless of their distance, across multiple quantum networks. This recipe is composed of two new concepts, minimum cost aggregation and network concatenation. Our recipe forms the necessary basis of designing a quantum internet protocol for networking self-organising quantum networks to make a global-scale quantum internet.</p>","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"21 1","pages":""},"PeriodicalIF":6.6000,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Quantum Information","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1038/s41534-025-01000-5","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

A quantum version of an internet, called a quantum internet, holds promise for achieving distributed quantum sensing and large-scale quantum computer networks, as well as quantum communication among arbitrary clients all over the globe. The main building block is efficient distribution of entanglement—entangled bits (ebits)—between arbitrary clients in a quantum network with error bounded by a constant, irrespective of their distance. In practice, this should be accomplished across multiple self-organising quantum networks, analogously to what the current internet does in conventional communication. Here we present a practical recipe on how to efficiently give arbitrary clients ebits with error bounded by a constant, regardless of their distance, across multiple quantum networks. This recipe is composed of two new concepts, minimum cost aggregation and network concatenation. Our recipe forms the necessary basis of designing a quantum internet protocol for networking self-organising quantum networks to make a global-scale quantum internet.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
npj Quantum Information
npj Quantum Information Computer Science-Computer Science (miscellaneous)
CiteScore
13.70
自引率
3.90%
发文量
130
审稿时长
29 weeks
期刊介绍: The scope of npj Quantum Information spans across all relevant disciplines, fields, approaches and levels and so considers outstanding work ranging from fundamental research to applications and technologies.
期刊最新文献
Networking quantum networks with minimum cost aggregation High-dimensional entanglement witnessed by correlations in arbitrary bases Realizing ultrahigh capacity quantum superdense coding on quantum photonic chip Quantum-enhanced dark matter detection with in-cavity control: mitigating the Rayleigh curse Halving the cost of quantum algorithms with randomization
×
引用
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