量子计算与黎曼猜想
Quantum Computing and the Riemann Hypothesis
摘要：
量子计算是一个很有前途的新的计算领域，量子算法提供了一个潜在的加速超过经典算法，如果容错量子计算机可以建立。经典计算机的最初应用之一是研究黎曼假设，量子计算机也可以应用于这个问题。在本文中，我们应用量子傅里叶变换（QFT）研究三个函数的非平凡零点服从一个版本的黎曼假设。我们用六个量子比特来执行我们的量子计算，但是如果量子纠错允许QFT算法缩放，则可以使用更多的量子比特。我们将这些函数表示为变换到动量空间的基态波函数。我们展示了如何在超对称量子力学中获得这些函数作为态。最后讨论了这类函数与（p，1）随机双矩阵模型的关系。
英文摘要：
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer was to the study of the Riemann hypothesis and quantum computers may be applied to this problem as well. In this paper we apply the Quantum Fourier Transform (QFT) to study three functions with non-trivial zeros obeying a version of the Riemann hypothesis. We perform our quantum computations with six qubits, but more qubits can be used if quantum error correction allows the QFT algorithm to scale. We represent these functions as ground state wave functions transformed to momentum space. We show how to obtain these functions as states in supersymmetric quantum mechanics. Finally we discuss the relation of these functions to (p,1) Random two matrix models at large N.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
