量子网络的纠缠量子比特定价

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xiaoyu Wang , Yu Jia , Yangming Zhao , Shouxi Luo , Haoze Chen , Chen Tian , Dong Zhang , Bingheng Yan
{"title":"量子网络的纠缠量子比特定价","authors":"Xiaoyu Wang ,&nbsp;Yu Jia ,&nbsp;Yangming Zhao ,&nbsp;Shouxi Luo ,&nbsp;Haoze Chen ,&nbsp;Chen Tian ,&nbsp;Dong Zhang ,&nbsp;Bingheng Yan","doi":"10.1016/j.comnet.2025.111728","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we propose an approach named Entangled quBit Pricing (EBP) to price the entangled quantum bits (called ebits) in Resources as a Service (RaaS) quantum networks. In such a quantum network, the service provider pursues the maximum payoff by setting the price of ebits over each link, based on which users decide the number of ebits to purchase such that they can obtain the maximum payoff from establishing entanglement connections (ECs). The unique feature of the routing related pricing issue in quantum networks is that a user may purchase a different number of ebits over each link along his entanglement path in order to establish one EC. By taking into consideration the interaction between the service provider and users, EBP can derive a pricing scheme such that each user will automatically choose the entanglement path and purchase ebits following the way to maximize the service provider’s payoff. Extensive simulations show that the service provider can obtain 97 % more payoff with EBP compared with simply setting higher prices to ebits that can successfully create entanglements with higher probability.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111728"},"PeriodicalIF":4.6000,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entangled qubit pricing for quantum networks\",\"authors\":\"Xiaoyu Wang ,&nbsp;Yu Jia ,&nbsp;Yangming Zhao ,&nbsp;Shouxi Luo ,&nbsp;Haoze Chen ,&nbsp;Chen Tian ,&nbsp;Dong Zhang ,&nbsp;Bingheng Yan\",\"doi\":\"10.1016/j.comnet.2025.111728\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we propose an approach named Entangled quBit Pricing (EBP) to price the entangled quantum bits (called ebits) in Resources as a Service (RaaS) quantum networks. In such a quantum network, the service provider pursues the maximum payoff by setting the price of ebits over each link, based on which users decide the number of ebits to purchase such that they can obtain the maximum payoff from establishing entanglement connections (ECs). The unique feature of the routing related pricing issue in quantum networks is that a user may purchase a different number of ebits over each link along his entanglement path in order to establish one EC. By taking into consideration the interaction between the service provider and users, EBP can derive a pricing scheme such that each user will automatically choose the entanglement path and purchase ebits following the way to maximize the service provider’s payoff. Extensive simulations show that the service provider can obtain 97 % more payoff with EBP compared with simply setting higher prices to ebits that can successfully create entanglements with higher probability.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"272 \",\"pages\":\"Article 111728\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2025-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625006942\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625006942","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一种称为纠缠量子比特定价(EBP)的方法来为资源即服务(RaaS)量子网络中的纠缠量子比特(称为ebit)定价。在这种量子网络中,服务提供商通过设定每个链路上的息比特价格来追求最大收益,用户据此决定购买的息比特数量,从而通过建立纠缠连接(ECs)获得最大收益。量子网络中路由相关定价问题的独特之处在于,为了建立一个EC,用户可能会在其纠缠路径上的每个链路上购买不同数量的ebit。通过考虑服务提供商和用户之间的相互作用,EBP可以推导出一种定价方案,使每个用户自动选择纠缠路径并按照服务提供商收益最大化的方式购买ebit。大量的模拟表明,与简单地为息税前利润设定更高的价格相比,服务提供商可以通过EBP获得97%以上的收益,后者可以成功地以更高的概率产生纠缠。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Entangled qubit pricing for quantum networks
In this paper, we propose an approach named Entangled quBit Pricing (EBP) to price the entangled quantum bits (called ebits) in Resources as a Service (RaaS) quantum networks. In such a quantum network, the service provider pursues the maximum payoff by setting the price of ebits over each link, based on which users decide the number of ebits to purchase such that they can obtain the maximum payoff from establishing entanglement connections (ECs). The unique feature of the routing related pricing issue in quantum networks is that a user may purchase a different number of ebits over each link along his entanglement path in order to establish one EC. By taking into consideration the interaction between the service provider and users, EBP can derive a pricing scheme such that each user will automatically choose the entanglement path and purchase ebits following the way to maximize the service provider’s payoff. Extensive simulations show that the service provider can obtain 97 % more payoff with EBP compared with simply setting higher prices to ebits that can successfully create entanglements with higher probability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信