在蒙蒂-霍尔游戏中利用多方纠缠共享秘密信息

IF 1.8 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Photonic Network Communications Pub Date : 2024-05-09 DOI:10.1007/s11107-024-01017-4
Hargeet Kaur, Kavit Shah, Debabrata Swain, Kaushal Shah
{"title":"在蒙蒂-霍尔游戏中利用多方纠缠共享秘密信息","authors":"Hargeet Kaur, Kavit Shah, Debabrata Swain, Kaushal Shah","doi":"10.1007/s11107-024-01017-4","DOIUrl":null,"url":null,"abstract":"<p>Quantum computing has emerged as a useful resource for winning random games. Monty Hall problem is one such game, where the powers of quantum mechanics can be utilized for winning the prize. Our paper depicts this problem as a two-player game, where the two players, i.e., the host and the participant share an entangled quantum state. The entangled state is closely knit with the position of the prize containing door, and the decision of the player i.e., either switch or stay from his initial choice of door. The two players are part of one team as they share a quantum communication channel among them by sharing the entangled state as a quantum resource. This enables them to share secret information about the position of the price as well as the strategy to opt for winning the game. The article shows a unique way of utilizing three different type of entangled states, three-qubit symmetric <i>W</i> state, three-qubit <span>\\(\\chi \\)</span> state, and five-qubit highly entangled Brown state. Further, the effectiveness of each quantum state as a source of communication in disguise is also compared. All the entangled states under study assure winning the price by the participant. However, each quantum state has different entanglement degree and offer varied merits as per the game setting.</p>","PeriodicalId":20057,"journal":{"name":"Photonic Network Communications","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secret Information Sharing using Multipartite Entanglement in Monty Hall Game\",\"authors\":\"Hargeet Kaur, Kavit Shah, Debabrata Swain, Kaushal Shah\",\"doi\":\"10.1007/s11107-024-01017-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Quantum computing has emerged as a useful resource for winning random games. Monty Hall problem is one such game, where the powers of quantum mechanics can be utilized for winning the prize. Our paper depicts this problem as a two-player game, where the two players, i.e., the host and the participant share an entangled quantum state. The entangled state is closely knit with the position of the prize containing door, and the decision of the player i.e., either switch or stay from his initial choice of door. The two players are part of one team as they share a quantum communication channel among them by sharing the entangled state as a quantum resource. This enables them to share secret information about the position of the price as well as the strategy to opt for winning the game. The article shows a unique way of utilizing three different type of entangled states, three-qubit symmetric <i>W</i> state, three-qubit <span>\\\\(\\\\chi \\\\)</span> state, and five-qubit highly entangled Brown state. Further, the effectiveness of each quantum state as a source of communication in disguise is also compared. All the entangled states under study assure winning the price by the participant. However, each quantum state has different entanglement degree and offer varied merits as per the game setting.</p>\",\"PeriodicalId\":20057,\"journal\":{\"name\":\"Photonic Network Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2024-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Photonic Network Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11107-024-01017-4\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Photonic Network Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11107-024-01017-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

量子计算已成为赢得随机游戏的有用资源。蒙蒂-霍尔问题就是这样一个可以利用量子力学的力量赢得奖金的游戏。我们的论文将这个问题描述为一个双人游戏,其中两个玩家,即主持人和参与者共享一个纠缠量子态。纠缠态与包含奖品的门的位置以及玩家的决定(即从最初选择的门切换或停留)密切相关。两个玩家是一个团队的成员,他们通过共享纠缠态这一量子资源来共享量子通信信道。这使他们能够共享关于价格位置的秘密信息以及赢得游戏的策略选择。文章展示了利用三种不同类型纠缠态的独特方法:三量子比特对称W态、三量子比特(\chi \)态和五量子比特高度纠缠布朗态。此外,还比较了每种量子态作为变相通信源的有效性。研究中的所有纠缠态都能确保参与者赢得价格。然而,每种量子态的纠缠程度不同,在不同的游戏设置下具有不同的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Secret Information Sharing using Multipartite Entanglement in Monty Hall Game

Quantum computing has emerged as a useful resource for winning random games. Monty Hall problem is one such game, where the powers of quantum mechanics can be utilized for winning the prize. Our paper depicts this problem as a two-player game, where the two players, i.e., the host and the participant share an entangled quantum state. The entangled state is closely knit with the position of the prize containing door, and the decision of the player i.e., either switch or stay from his initial choice of door. The two players are part of one team as they share a quantum communication channel among them by sharing the entangled state as a quantum resource. This enables them to share secret information about the position of the price as well as the strategy to opt for winning the game. The article shows a unique way of utilizing three different type of entangled states, three-qubit symmetric W state, three-qubit \(\chi \) state, and five-qubit highly entangled Brown state. Further, the effectiveness of each quantum state as a source of communication in disguise is also compared. All the entangled states under study assure winning the price by the participant. However, each quantum state has different entanglement degree and offer varied merits as per the game setting.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Photonic Network Communications
Photonic Network Communications 工程技术-电信学
CiteScore
4.10
自引率
5.90%
发文量
33
审稿时长
12 months
期刊介绍: This journal publishes papers involving optical communication networks. Coverage includes network and system technologies; network and system architectures; network access and control; network design, planning, and operation; interworking; and application design for an optical infrastructure This journal publishes high-quality, peer-reviewed papers presenting research results, major achievements, and trends involving all aspects of optical network communications. Among the topics explored are transport, access, and customer premises networks; local, regional, and global networks; transoceanic and undersea networks; optical transparent networks; WDM, HWDM, and OTDM networks and more.
期刊最新文献
The way toward truly QoS-aware EPON GSNR-aware resource re-provisioning for C to C+L-bands upgrade in optical backbone networks End-to-end slicing of RAN based on next-generation optical access network Routing, modulation, core and spectrum assignment techniques for crosstalk management in multi-core fiber based spatially multiplexed elastic optical networks Low-complexity high linewidth-tolerant carrier synchronization for 16QAM using pilot-assisted RLS algorithm
×
引用
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