arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节（Veterans Day），12 日无更新
arXiv quant-ph/9811039quant-ph
收藏

量子计算的非机械性

The Non-mechanistic Character of Quantum Computation

Giuseppe Castagnoli, Dalida Monti

备注：
revision 4: further developed the notion that quantum efficiency comes from driving the computation process through a final condition; various clarifications after receiving comments; reduced the number of figures; 10 text pages (1 file), 2 figures (1 additional file); submitted for the Proceedings of the International Quantum Structures Association Conference, Liptovsky Jan, September 1998
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

一些量子算法所表现出的高于经典的效率在这里归因于它们的非机械特性，这通过加入纠缠和量子测量的概念而变得明显。测量类似地对难以逆转的函数的计算的输出设置（部分）约束。该约束沿着可逆计算过程在时间上回溯，计算反向函数，这产生量子效率。演化，包括波函数崩溃（这里是一个修改的概念），是非机械的，因为它是由初始条件和最终约束。看起来，产出越受测量的约束，效率就越高。通过特殊的芝诺效应，设置一个完全约束，（推测地）产生NP-完全= P。

英文摘要：

The higher than classical efficiency exhibited by some quantum algorithms is here ascribed to their non-mechanistic character, which becomes evident by joining the notions of entanglement and quantum measurement. Measurement analogically sets a (partial) constraint on the output of the computation of a hard-to-reverse function. This constraint goes back in time along the reversible computation process, computing the reverse function, which yields quantum efficiency. The evolution, comprising wave function collapse (here a revamped notion), is non-mechanistic as it is driven by both an initial condition and a final constraint. It seems that the more the output is constrained by measurement, the higher can be the efficiency. Setting a complete constraint, by means of a special Zeno effect, yields (speculatively) NP-complete=P.

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

↑