摘要
随着Grover量子搜索算法的不断发展,它的实际应用价值也在逐渐体现。通过介绍量子并行计算和量子算法的基本思想以及对改进的Grover搜索算法进行研究的基础上,分析给出了一个时间复杂度为O()的求解最优装载问题的量子算法。对于最优装载问题,分别用经典计算机上的贪心算法和量子算法来求解,得出了这两种算法的时间复杂度,从而可以看出量子算法相对于经典算法具有更快的搜索速度。
With the growth of Grover＇s quantum search algorithms, it is applied to practical uses gradually. By introducing of the fundamental principles of quantum parallelism and quantum algorithms and studying the improved Grover searching algorithm, a quantum mechanical algorithm is given to solve optimal loading problem, and is proved its time complexity to O （√N）. As to the optimal loading problem, two methods are given to resolve the problem respectively, that is, greed algorithm in the classic computers and quantum algorithm. The time complexity of this two algorithms is gained. In the conclusion, quantum algorithms solve many search problems more efficiently than classic algorithms.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第2期278-279,282,共3页
Computer Engineering and Design
