用NMR量子计算机演示量子算法加速
Demonstrating quantum algorithm acceleration with NMR quantum computer
摘要:
一般来说,量子线路由基本门构成,例如单量子位门和CNOT门。然而,有可能通过将这些基本门合并到更大的模块中来加速给定电路的执行时间,使得直接实现表达算法的期望酉矩阵。我们证明了这一点,采取两个量子比特格罗弗的算法实现NMR量子计算,其伪纯态产生的状态种群的循环排列。这是第一个精确的时间最优解,据我们所知,获得了一个独立的量子算法。
英文摘要:
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for a self-contained quantum algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。