有量子伪心灵感应和无量子伪心灵感应的比特通信

IF 6.6 1区 物理与天体物理 Q1 PHYSICS, APPLIED
István Márton, Erika Bene, Péter Diviánszky, Tamás Vértesi
{"title":"有量子伪心灵感应和无量子伪心灵感应的比特通信","authors":"István Márton, Erika Bene, Péter Diviánszky, Tamás Vértesi","doi":"10.1038/s41534-024-00874-1","DOIUrl":null,"url":null,"abstract":"<p>According to Bell’s theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). Suppose that we can augment LHV by some amount of classical communication. The question then arises as to how many bits are needed to simulate entangled states? There is very strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. However, the problem of simulating measurements on higher-dimensional systems remains largely unexplored. In this study, we present Bell-like scenarios, even with three inputs per party, in which bipartite correlations resulting from measurements on higher-dimensional states cannot be simulated with a single bit of communication. We consider the case where the communication direction is fixed and the case where it is bidirectional. To this end, we introduce constructions based on parallel repetition of pseudo-telepathy games and an original algorithm based on branch-and-bound technique to compute the one-bit classical bound. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a 16 × 16 state to beat the bidirectional one-bit classical bound, and look a promising candidate for implementation on an optical platform.</p>","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":null,"pages":null},"PeriodicalIF":6.6000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Beating one bit of communication with and without quantum pseudo-telepathy\",\"authors\":\"István Márton, Erika Bene, Péter Diviánszky, Tamás Vértesi\",\"doi\":\"10.1038/s41534-024-00874-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>According to Bell’s theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). Suppose that we can augment LHV by some amount of classical communication. The question then arises as to how many bits are needed to simulate entangled states? There is very strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. However, the problem of simulating measurements on higher-dimensional systems remains largely unexplored. In this study, we present Bell-like scenarios, even with three inputs per party, in which bipartite correlations resulting from measurements on higher-dimensional states cannot be simulated with a single bit of communication. We consider the case where the communication direction is fixed and the case where it is bidirectional. To this end, we introduce constructions based on parallel repetition of pseudo-telepathy games and an original algorithm based on branch-and-bound technique to compute the one-bit classical bound. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a 16 × 16 state to beat the bidirectional one-bit classical bound, and look a promising candidate for implementation on an optical platform.</p>\",\"PeriodicalId\":19212,\"journal\":{\"name\":\"npj Quantum Information\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2024-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"npj Quantum Information\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.1038/s41534-024-00874-1\",\"RegionNum\":1,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Quantum Information","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1038/s41534-024-00874-1","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

根据贝尔定理,某些纠缠状态无法用局部隐变量(LHV)进行经典模拟。假设我们可以通过一定量的经典通信来增强 LHV。那么问题来了,模拟纠缠态需要多少比特?有非常有力的证据表明,单比特通信足以模拟对任何双量子比特纠缠态的投影测量。然而,模拟高维系统测量的问题在很大程度上仍未得到探索。在本研究中,我们提出了类似贝尔的情况,即使每一方有三个输入,也无法用单个比特通信模拟对高维状态的测量所产生的双向相关性。我们考虑了通信方向固定的情况和双向通信的情况。为此,我们引入了基于并行重复伪心灵感应博弈的结构和基于分支与边界技术的原创算法,以计算单比特经典约束。事实证明,具有代表性的贝尔表达式的两个副本(如魔术方块伪心灵感应游戏)特别强大,只需 16 × 16 个状态就能击败双向的一位经典约束,因此有望在光学平台上实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Beating one bit of communication with and without quantum pseudo-telepathy

Beating one bit of communication with and without quantum pseudo-telepathy

According to Bell’s theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). Suppose that we can augment LHV by some amount of classical communication. The question then arises as to how many bits are needed to simulate entangled states? There is very strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. However, the problem of simulating measurements on higher-dimensional systems remains largely unexplored. In this study, we present Bell-like scenarios, even with three inputs per party, in which bipartite correlations resulting from measurements on higher-dimensional states cannot be simulated with a single bit of communication. We consider the case where the communication direction is fixed and the case where it is bidirectional. To this end, we introduce constructions based on parallel repetition of pseudo-telepathy games and an original algorithm based on branch-and-bound technique to compute the one-bit classical bound. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a 16 × 16 state to beat the bidirectional one-bit classical bound, and look a promising candidate for implementation on an optical platform.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
npj Quantum Information
npj Quantum Information Computer Science-Computer Science (miscellaneous)
CiteScore
13.70
自引率
3.90%
发文量
130
审稿时长
29 weeks
期刊介绍: The scope of npj Quantum Information spans across all relevant disciplines, fields, approaches and levels and so considers outstanding work ranging from fundamental research to applications and technologies.
×
引用
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学术官方微信