量子系统中的量子伪随机性
Algorithmic Pseudorandomness in Quantum Setups
摘要:
丘奇-图灵命题是计算机科学的支柱之一;它假设每个经典系统都具有与所谓的图灵机等效的可计算能力。虽然这篇论文对我们理解计算设备至关重要,但它在其他科学领域的影响却很少被探索。在这里,我们在量子物理的背景下开始这项研究计划,并表明计算机科学定律对该理论的一些最基本的结果具有深远的影响。我们首先展示了他们如何质疑我们关于混合量子态是什么的知识,因为我们确定了定义相同混合态的量子态的集合的情况,根据量子公设不可区分,当由计算机准备时,它们确实变得可区分。我们还显示了一个新的漏洞贝尔实验:如果在贝尔实验中的一些当事人使用计算机来决定哪些测量,然后窃听者的计算资源必须是有限的,以便有一个适当的观察非局部性。我们的工作为寻找统一计算机科学和量子物理的框架开辟了新的方向。
英文摘要:
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. While this thesis is crucial for our understanding of computing devices, its implications in other scientific fields have hardly been explored. Here we start this research programme in the context of quantum physics and show that computer science laws have profound implications for some of the most fundamental results of the theory. We first show how they question our knowledge on what a mixed quantum state is, as we identify situations in which ensembles of quantum states defining the same mixed state, indistinguishable according to the quantum postulates, do become distinguishable when prepared by a computer. We also show a new loophole for Bell-like experiments: if some of the parties in a Bell-like experiment use a computer to decide which measurements to make, then the computational resources of an eavesdropper have to be limited in order to have a proper observation of non-locality. Our work opens a new direction in the search for a framework unifying computer science and quantum physics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。