论文标题
回顾性量子计算
Retrodictive Quantum Computing
论文作者
论文摘要
人们普遍认为，量子模型比经典模型更强大。努力集中在证明，对于给定的问题，量子算法比任何经典算法都更有效。但是，所有这些都假定了推理的标准预测范式，在初始条件下，未来可以得到答案。如何将未来的信息带到现在并利用它的优势？这是一种用于推理，所谓的回顾性计算的根本新方法，它从计算函数的特定形式中受益。我们演示了如何使用符号计算工具来实现大规模的循环量子计算，并利用它有效地，经典地解决了量子Deutsch-Jozsa，Bernstein-Vazirani，Simon，Grover，Grover和Shor的算法的实例。
Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however, assumes a standard predictive paradigm of reasoning where, given initial conditions, the future holds the answer. How about bringing information from the future to the present and exploit it to one's advantage? This is a radical new approach for reasoning, so-called Retrodictive Computation, that benefits from the specific form of the computed functions. We demonstrate how to use tools of symbolic computation to realize retrodictive quantum computing at scale and exploit it to efficiently, and classically, solve instances of the quantum Deutsch-Jozsa, Bernstein-Vazirani, Simon, Grover, and Shor's algorithms.
