Quantum Switches for Gottesman–Kitaev–Preskill Qubit-Based All-Photonic Quantum Networks

Mohadeseh Azari;Paul Polakos;Kaushik P. Seshadreesan
{"title":"Quantum Switches for Gottesman–Kitaev–Preskill Qubit-Based All-Photonic Quantum Networks","authors":"Mohadeseh Azari;Paul Polakos;Kaushik P. Seshadreesan","doi":"10.1109/TQE.2024.3476009","DOIUrl":null,"url":null,"abstract":"The Gottesman–Kitaev–Preskill (GKP) code, being information theoretically near optimal for quantum communication over Gaussian thermal-loss optical channels, is likely to be the encoding of choice for advanced quantum networks of the future. Quantum repeaters based on GKP-encoded light have been shown to support high end-to-end entanglement rates across large distances despite realistic finite squeezing in GKP code preparation and homodyne detection inefficiencies. Here, we introduce a quantum switch for GKP qubit-based quantum networks. Its architecture involves multiplexed GKP qubit-based entanglement link generation with clients and their all-photonic storage, enabled by GKP qubit graph state resources. The switch uses a multiclient generalization of a recently introduced entanglement-ranking-based link matching heuristic for bipartite entanglement distribution between clients via entanglement swapping. Since generating the GKP qubit graph state resource is hardware intensive, given a total resource budget and an arbitrary layout of clients, we address the question of their optimal allocation to the different client–pair connections served by the switch such that the switch's sum throughput is maximized while also being fair in terms of the individual entanglement rates. We illustrate our results for an exemplary data center network, where the data center is a client of a switch, and all of its other clients aim to connect to the data center alone—a scenario that also captures the general case of a gateway router connecting a local area network to a global network. Together with compatible quantum repeaters, our quantum switch provides a way to realize quantum networks of arbitrary topology.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10720623","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Quantum Engineering","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10720623/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Gottesman–Kitaev–Preskill (GKP) code, being information theoretically near optimal for quantum communication over Gaussian thermal-loss optical channels, is likely to be the encoding of choice for advanced quantum networks of the future. Quantum repeaters based on GKP-encoded light have been shown to support high end-to-end entanglement rates across large distances despite realistic finite squeezing in GKP code preparation and homodyne detection inefficiencies. Here, we introduce a quantum switch for GKP qubit-based quantum networks. Its architecture involves multiplexed GKP qubit-based entanglement link generation with clients and their all-photonic storage, enabled by GKP qubit graph state resources. The switch uses a multiclient generalization of a recently introduced entanglement-ranking-based link matching heuristic for bipartite entanglement distribution between clients via entanglement swapping. Since generating the GKP qubit graph state resource is hardware intensive, given a total resource budget and an arbitrary layout of clients, we address the question of their optimal allocation to the different client–pair connections served by the switch such that the switch's sum throughput is maximized while also being fair in terms of the individual entanglement rates. We illustrate our results for an exemplary data center network, where the data center is a client of a switch, and all of its other clients aim to connect to the data center alone—a scenario that also captures the general case of a gateway router connecting a local area network to a global network. Together with compatible quantum repeaters, our quantum switch provides a way to realize quantum networks of arbitrary topology.
基于戈特曼-基塔埃夫-普雷斯基尔丘比特的全光子量子网络的量子开关
戈特曼-基塔埃夫-普雷斯基尔(Gottesman-Kitaev-Preskill,GKP)编码在信息理论上接近高斯热损耗光通道量子通信的最优编码,很可能成为未来先进量子网络的首选编码。基于 GKP 编码光的量子中继器已被证明可支持大距离的高端到端纠缠率,尽管在 GKP 编码准备和同调检测效率低下的情况下存在现实的有限挤压。在这里,我们为基于 GKP 量子比特的量子网络引入了一种量子开关。其架构包括基于 GKP 量子比特的多路复用纠缠链路生成、客户端及其全光子存储,并由 GKP 量子比特图状态资源支持。该交换机使用了最近推出的基于纠缠排序的链路匹配启发式的多客户端概括,通过纠缠交换实现客户端之间的双向纠缠分配。由于生成 GKP 量子图状态资源是硬件密集型的,因此在给定总资源预算和任意客户机布局的情况下,我们要解决的问题是如何将这些资源优化分配给交换机所服务的不同客户机对连接,从而使交换机的总吞吐量最大化,同时在单个纠缠率方面也是公平的。我们以一个典型的数据中心网络为例说明我们的研究结果,在这个网络中,数据中心是交换机的一个客户,而交换机的所有其他客户都以连接到数据中心为目标--这种情况也捕捉到了连接局域网和全球网络的网关路由器的一般情况。我们的量子交换机与兼容的量子中继器一起,为实现任意拓扑结构的量子网络提供了一种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.00
自引率
0.00%
发文量
0
×
引用
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学术官方微信