序列量子逻辑命题在量子计算机上的不确定性测试
Nondeterministic testing of Sequential Quantum Logic propositions on a quantum computer
摘要：
在过去的几年中，已经证明，通用的量子计算可以通过投影测量单独获得，而不需要酉门。这表明量子计算的基本逻辑可能是量子测量序列的代数，而不是幺正算子乘积的代数。这种顺序量子逻辑（SQL）是在70年代后期发展起来的，最近被应用于量子力学的一致性历史框架，作为量子引力理论的一条可能途径。在这封信中，我给出了一个在量子计算机上判定SQL中一个命题的真值的方法，其成功概率为非零。
英文摘要：
In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of sequences of quantum measurements rather than an algebra of products of unitary operators. Such a Sequential Quantum Logic (SQL) was developed in the late 70's and has more recently been applied to the consistent histories framework of quantum mechanics as a possible route to the theory of quantum gravity. In this letter, I give a method for deciding the truth of a proposition in SQL with nonzero probability of success on a quantum computer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
