Quantum algorithm for finding optimal loading
Li Sun · Jisuanji gongcheng yu sheji · 2007
With the growth of Grover's quantum search algorithms,it is applied to practical uses gradually.By introducing of the fun-damental 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().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 al-gorithm.The time complexity of this two algorithms is gained.In the conclusion,quantum algorithms solve many search problems more efficiently than classic algorithms.