[1]LI Pan-chi,LI Shi-yong.An improved measure in Grover quantum searching algorithm[J].CAAI Transactions on Intelligent Systems,2007,2(1):35-39.
Copy

An improved measure in Grover quantum searching algorithm

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 2 Number of periods: 2007 1 Page number: 35-39 Column: 学术论文—人工智能基础 Public date: 2007-02-25
Title:
An improved measure in Grover quantum searching algorithm
Author(s):
LI Pan-chi1; 2;  LI Shi-yong1
1.School of Astronautics, Harbin Institute of Technology , Harbin 150001, China;
2. Department of Computer Science, Daqing Petroleum Insti tute, Daqing 163318, China
Keywords:
Grover algorithm;  phase matching;  quantum searching;  quantum computing
CLC:
TP18
DOI:
-
Abstract:
When the current Grover algorithm is applied to search some objects in an unsorted quantum database, the probability of correct objects usually falls with the increase of the searched objects. The reason for this problem is analyz ed in this paper, and an improved measure based on the new phase matching condit ion is proposed. In the new phase matching condition, the amplitudes of two phas e rotations are the same and the directions of two phase rotations are contrary . Whe n the objects are more than one third of the total items, with the new phase mat ching condition, all objects can be found by at least 25/27 of the probability a nd by the only one Grover iteration. The validity of the improved measure is pr oved by experiment.
References:
［1］ GROVER L K. A fast quantum mechanical algorithm for database search ［A］.Proce edings of the 28th Annual ACM Symposium on the Theory of Computing ［C］. Pennsylvania, 1996.
［2］SHOR P W. Algorithms for quantum computation: discrete logarithms and fact oring［A］. Proceedings of the 35th Annual Symposium on the Foundation of Compu ter Science ［C］. Los Alamitos, 1994.
［3］NIELSEN M A, CHUANG I L. Quantum computation and quantum information ［M］ . London: Cambridge University Press, 2000.
［4］GROVER L K. Quantum computers can search rapidly by using almost any trans formation ［J］. Physical Review Letters,1998, 80(29): 4329-4332.
［5］LONG G L, LI Y S, ZHANG W L, et al. Phase matching in quantum searching［J ］.Physics Letters A，1999, 26(10):27-34.
［6］BIHAM E, BIHAM O, BIRON D, et al. Grover’s quantum search algorithm for an arbitrary initial amplitude distribution ［J］. Physical Review A，1999, 60(4): 2742-2745.
［7］BIHAM E, KENIGSBERG D. Grover’s quantum search algorithm for an arbit rary initial mixed state ［J］. Physical Review A，2002，66(6): 2301-2304.
［8］BIHAM O, SHAPIRA D, SHIMONI Y. Analysis of Grover’s quantum search al gorit hm as a dynamical system ［J］. Physical Review A，2003, 68(2): 2326 -2333.
［9］VENTURA D, MARTINEZ T. Quantum associative memory ［J］. Information Scien ces，2000(124): 273-296.
［10］EZHOV A, NIFANOVA A, VENTURA D. Quantum associative memory with distribut ed queries ［J］. Information Sciences，2000(128): 271-293
［11］李士勇, 李盼池. 基于实数编码和目标函数梯度的量子遗传算法［J］. 哈尔滨工业大学学报，2006, 38(8): 1216-1218.
?LI Shiyong, LI Panchi. A quantum genetic algorithm based on real encoding and gr adient information of object function ［J］. Journal of Harbin Institute of Tech nology，2006, 38(8): 1216-1218
Similar References:

Memo

-

Last Update: 2009-05-05

Copyright © CAAI Transactions on Intelligent Systems