On the Capacity Region of Bipartite and Tripartite Entanglement Switching

IF 0.7 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on Modeling and Performance Evaluation of Computing Systems Pub Date : 2019-01-21 DOI:10.1145/3571809
Gayane Vardoyan, P. Nain, S. Guha, D. Towsley
{"title":"On the Capacity Region of Bipartite and Tripartite Entanglement Switching","authors":"Gayane Vardoyan, P. Nain, S. Guha, D. Towsley","doi":"10.1145/3571809","DOIUrl":null,"url":null,"abstract":"We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances. Additionally, the switch is equipped with entanglement switching logic, enabling it to implement switching policies to better serve the needs of the network. In this work, the function of the switch is to create bipartite or tripartite entangled states among users at the highest possible rates at a fixed ratio. Using Markov chains, we model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user, and find that the best policies outperform a time division multiplexing policy for sharing the switch between bipartite and tripartite state generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of quantum state decoherence and associated cut-off times for qubit storage, obtaining similar results. Moreover, decoherence-associated quantum storage cut-off times appear to have little effect on capacity in our identical-link system. We also study a smaller class of policies when the switch stores two qubits per user.","PeriodicalId":56350,"journal":{"name":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","volume":"8 1","pages":"1 - 18"},"PeriodicalIF":0.7000,"publicationDate":"2019-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3571809","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

Abstract

We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances. Additionally, the switch is equipped with entanglement switching logic, enabling it to implement switching policies to better serve the needs of the network. In this work, the function of the switch is to create bipartite or tripartite entangled states among users at the highest possible rates at a fixed ratio. Using Markov chains, we model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user, and find that the best policies outperform a time division multiplexing policy for sharing the switch between bipartite and tripartite state generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of quantum state decoherence and associated cut-off times for qubit storage, obtaining similar results. Moreover, decoherence-associated quantum storage cut-off times appear to have little effect on capacity in our identical-link system. We also study a smaller class of policies when the switch stores two qubits per user.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于二方和三方纠缠切换的容量域
研究了一种在具有等长链路的星形拓扑中服务于一组用户的量子纠缠分配交换机。量子交换机,很像量子中继器,可以执行纠缠交换,将纠缠扩展到更远的距离。此外,交换机还配置了纠缠交换逻辑,使其能够更好地实现交换策略,以满足网络的需求。在这项工作中,开关的功能是在用户之间以尽可能高的速率以固定的比率创建二部或三部纠缠态。利用马尔可夫链,建立了一组随机交换策略的模型。发现一些策略比其他策略更好,我们给出了交换机每个用户存储一个量子位的情况的分析结果,并发现最佳策略优于分时复用策略,用于共享两部分和三部分状态生成之间的切换。这种性能改进会随着用户数量的增加而降低。该模型很容易扩展到研究存在量子态退相干和相关的量子位存储截止时间的容量区域,得到类似的结果。此外,退相干相关的量子存储截止时间似乎对我们的同链系统的容量几乎没有影响。当交换机为每个用户存储两个量子位时,我们还研究了一类较小的策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.10
自引率
0.00%
发文量
9
期刊最新文献
Configuring and Coordinating End-to-End QoS for Emerging Storage Infrastructure An approximation method for a non-preemptive multiserver queue with quasi-Poisson arrivals From compositional Petri Net modeling to macro and micro simulation by means of Stochastic Simulation and Agent-Based models No-regret Caching via Online Mirror Descent Optimal Pricing in a Single Server System
×
引用
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