讨论量子加速的解释
Discussing the explanation of the quantum speed up
摘要:
在以前的工作中,我们证明了量子算法是一个经典算法的历史的总和,该算法预先知道关于问题解决方案的50%的信息-每个历史都是获得高级信息的可能方式和计算缺失信息的可能结果。我们给出了这个50%高级信息规则的理论证明,并检查了它对各种量子算法的适用性。现在我们进一步详细讨论理论上的证明,并反驳一个可能的反对意见。我们表明,该规则是一个简单的,众所周知的,量子非定域性的解释的推广-其中测量结果之间的逻辑相关性是物理支持的因果关系/确定性/本地过程与因果关系允许回溯的时间与回溯状态矢量减少。可能的反对意见是,量子算法通常以一种表面上确定的方式产生问题的解(当它们的幺正部分产生待测量的可观测量的本征态,而测量产生相应的本征值--解--概率为1),而目前对加速的解释依赖于量子测量的非确定性特征。我们表明,这种反对将错误的确定性生产的一个确定的结果的非确定性生产。
英文摘要:
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the advanced information and a possible result of computing the missing information. We gave a theoretical justification of this 50% advanced information rule and checked that it holds for a large variety of quantum algorithms. Now we discuss the theoretical justification in further detail and counter a possible objection. We show that the rule is the generalization of a simple, well known, explanation of quantum nonlocality - where logical correlation between measurement outcomes is physically backed by a causal/deterministic/local process with causality allowed to go backward in time with backdated state vector reduction. The possible objection is that quantum algorithms often produce the solution of the problem in an apparently deterministic way (when their unitary part produces an eigenstate of the observable to be measured and measurement produces the corresponding eigenvalue - the solution - with probability 1), while the present explanation of the speed up relies on the nondeterministic character of quantum measurement. We show that this objection would mistake the nondeterministic production of a definite outcome for a deterministic production.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。