由量子准备情境性驱动的广义奇偶校验盲通信游戏

IF 2 3区 物理与天体物理 Q2 PHYSICS, MATHEMATICAL Journal of Physics A: Mathematical and Theoretical Pub Date : 2024-08-28 DOI:10.1088/1751-8121/ad7108
Prabuddha Roy, A K Pan
{"title":"由量子准备情境性驱动的广义奇偶校验盲通信游戏","authors":"Prabuddha Roy, A K Pan","doi":"10.1088/1751-8121/ad7108","DOIUrl":null,"url":null,"abstract":"The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice’s amount of communication to Bob is constraint by the parity-oblivious (PO) conditions, so that the parity information of her inputs remains oblivious to Bob. The PO condition in an operational theory is equivalently represented in an ontological model that satisfies the preparation noncontextuality. In this paper, we provide a nontrivial generalization of the existing two-level PORAC and derive the winning probability of the game in the preparation noncontextual ontological model. We demonstrate that the quantum theory outperforms the preparation noncontextual model by predicting higher winning probability in our generalized PORAC.","PeriodicalId":16763,"journal":{"name":"Journal of Physics A: Mathematical and Theoretical","volume":"5 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized parity-oblivious communication games powered by quantum preparation contextuality\",\"authors\":\"Prabuddha Roy, A K Pan\",\"doi\":\"10.1088/1751-8121/ad7108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice’s amount of communication to Bob is constraint by the parity-oblivious (PO) conditions, so that the parity information of her inputs remains oblivious to Bob. The PO condition in an operational theory is equivalently represented in an ontological model that satisfies the preparation noncontextuality. In this paper, we provide a nontrivial generalization of the existing two-level PORAC and derive the winning probability of the game in the preparation noncontextual ontological model. We demonstrate that the quantum theory outperforms the preparation noncontextual model by predicting higher winning probability in our generalized PORAC.\",\"PeriodicalId\":16763,\"journal\":{\"name\":\"Journal of Physics A: Mathematical and Theoretical\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Physics A: Mathematical and Theoretical\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1088/1751-8121/ad7108\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics A: Mathematical and Theoretical","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1088/1751-8121/ad7108","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

摘要

奇偶校验保密随机存取码(PORAC)是一类涉及发送方(爱丽丝)和接收方(鲍勃)的通信博弈。在这类博弈中,爱丽丝与鲍勃的通信量受奇偶校验无关(PO)条件的限制,因此鲍勃对爱丽丝输入的奇偶校验信息一无所知。在运算理论中,PO 条件等同于本体论模型,它满足非上下文准备的要求。在本文中,我们对现有的两级 PORAC 进行了非难一般化,并推导出了准备非上下文本体模型中博弈的获胜概率。我们证明,量子理论在我们的广义 PORAC 中预测了更高的获胜概率,从而优于准备非上下文模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Generalized parity-oblivious communication games powered by quantum preparation contextuality
The parity-oblivious random-access-code (PORAC) is a class of communication games involving a sender (Alice) and a receiver (Bob). In such games, Alice’s amount of communication to Bob is constraint by the parity-oblivious (PO) conditions, so that the parity information of her inputs remains oblivious to Bob. The PO condition in an operational theory is equivalently represented in an ontological model that satisfies the preparation noncontextuality. In this paper, we provide a nontrivial generalization of the existing two-level PORAC and derive the winning probability of the game in the preparation noncontextual ontological model. We demonstrate that the quantum theory outperforms the preparation noncontextual model by predicting higher winning probability in our generalized PORAC.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.10
自引率
14.30%
发文量
542
审稿时长
1.9 months
期刊介绍: Publishing 50 issues a year, Journal of Physics A: Mathematical and Theoretical is a major journal of theoretical physics reporting research on the mathematical structures that describe fundamental processes of the physical world and on the analytical, computational and numerical methods for exploring these structures.
期刊最新文献
Laplacian operator and its square lattice discretization: Green function vs. Lattice Green function for the flat 2-torus and other related 2D manifolds The role of mobility in epidemics near criticality Projected state ensemble of a generic model of many-body quantum chaos Quantising a Hamiltonian curl force Operator dynamics and entanglement in space-time dual Hadamard lattices
×
引用
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