摘要
Jacobi算法用于求解实对称矩阵的特征值和特征向量,算法中最费时的环节为查找非对角元素最大值;量子计算中的Grover算法在搜索规模为N的无序数据库时可以将时间复杂度降为O(N^(1/2))。本文提出用Grover算法的扩展算法——最大值查找的量子算法去加速Jacobi算法中最费时的步骤,进而提高整个算法的计算速度。
The most time-consuming step of Jacobi algorithm which is used to solve the eigenvalues and eigenvectors of real symmetric matrices is to find the maximum value of non- diagonal elements. The approach using a quantum algorithm of finding the maximum which itself is a generalization of Grover＇s searching algorithm to accelerate the most time-consuming step is pro- posed to accelerate the whole Jacohi algorithm.
出处
《科学技术创新》
2017年第24期1-2,共2页
Scientific and Technological Innovation
