arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07325quant-phcs.FL
收藏

论量子不确定性的起源

On the Origin of Quantum Uncertainty

Christoph Adami

AI总结:

本文通过构造相互写入对方程序空间的经典图灵机,证明其联合状态确定而个体状态不确定,从而论证量子不确定性的根源在于数学逻辑中固有的非决定论。

摘要:

量子测量中固有不确定性的起源自量子理论诞生以来就已被讨论,但迄今为止,相对于量子态制备方向成一定角度进行的测量所产生的不确定性的来源仍属未知。本文提出,量子不确定性是数学逻辑中固有非决定论的一种表现。通过显式构造一对相互写入对方程序空间的经典图灵机,我证明这样一对机器的联合状态是确定的,而单个机器的状态则是不确定的,这与量子测量中的情形完全一致。特别地,单个机器的本征态表现为经典态的叠加,尽管其本征值为零。由于这些“经典纠缠”图灵机本质上实现了不可判定的“停机问题”,这一构造表明,当询问此类机器关于其状态时所产生的不可避免的随机性,正是 Chaitin 停机概率的比特中所固有的随机性。由于这一经典构造与量子测量形成镜像对应,我论证量子不确定性具有相同的起源。

英文摘要:

The origin of the uncertainty inherent in quantum measurements has been discussed since quantum theory's inception, but to date the source of the indeterminacy of measurements performed at an angle with respect to a quantum state's preparation is unknown. Here I propose that quantum uncertainty is a manifestation of the indeterminism inherent in mathematical logic. By explicitly constructing pairs of classical Turing machines that write into each others' program space, I show that the joint state of such a pair is determined, while the state of the individual machine is not, precisely as in quantum measurement. In particular, the eigenstates of the individual machines appear to be superpositions of classical states, albeit with vanishing eigenvalue. Because these "classically entangled" Turing machines essentially implement undecidable "halting problems", this construction suggests that the inevitable randomness that results when interrogating such machines about their state is precisely the randomness inherent in the bits of Chaitin's halting probability. Because this classical construction mirrors quantum measurement, I argue that quantum uncertainty has the same origin.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑