用最低成本聚合技术实现量子网络联网

IF 6.6 1区 物理与天体物理 Q1 PHYSICS, APPLIED
Koji Azuma
{"title":"用最低成本聚合技术实现量子网络联网","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":"{\"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}","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

摘要

量子版本的互联网被称为量子互联网,有望实现分布式量子传感和大规模量子计算机网络,以及全球任意客户端之间的量子通信。量子网络的主要组成部分是在量子网络中任意客户端之间有效分配纠缠比特(ebit),其误差以常数为界,与客户端之间的距离无关。在实践中,这应该在多个自组织量子网络中完成,类似于当前互联网在传统通信中的作用。在这里,我们提出了一个实用的方法,如何在多个量子网络中有效地给出任意客户端ebit,误差以常数为界,而不管它们的距离如何。该配方由最小成本聚合和网络连接两个新概念组成。我们的配方构成了设计量子互联网协议的必要基础,该协议用于将自组织量子网络联网,以构建全球规模的量子互联网。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Networking quantum networks with minimum cost aggregation

Networking quantum networks with minimum cost aggregation

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
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学术官方微信