基于量子搜索算法的线性序矩阵求逆方法
Linear Order Matrix Inversion Method with Help from Quantum Searching Algorithm
摘要:
提出了一种利用量子搜索算法求矩阵逆的方法。在该方法中,巨大的希尔伯特空间作为一个整体的无数的本征态的搜索和评估有效的顺序降维一个接一个。搜索所需的总迭代步骤与未知变量的数量成正比。我们的方法可以解决非常大的线性方程组有足够高的概率比任何现有的经典算法,这大致取决于未知变量的立方更快。
英文摘要:
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension one by one. Total iteration steps required for search are proportional to the number of unknown variables. Our method could solve very large linear equations with sufficiently high probability faster than any existing classical algorithms, which roughly depends on the cube of unknown variables.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。