Improvements on quantum binary searching algorithm  

作　　者：李慧 李春文 姜敏 

机构地区：[1]Department of Automation, Tsinghua University [2]Department of Electronics and Information, Soochou University

出　　处：《Optoelectronics Letters》2009年第5期391-392,共2页光电子快报（英文版）

基　　金：supported by the National Natural Science Foundation of China (No. 60674039, 60433050)

摘　　要：In order to solve the ordered quantum database search problem,a quantum binary searching algorithm was proposed which can be used to implement the whole searching process in four steps. Considering the characteristic of quantum parallelism,this paper further improves the searching process,which can be realized in only two steps,and presents the circuit implementation. In this scheme,the number of the quantum logic gates doesn't increase. Moreover,the losing-solution issue in the quantum binary searching algorithm can be efficiently prevented.In order to solve the ordered quantum database search problem, a quantum binary searching algorithm was proposed which can be used to implement the whole searching process in four steps. Considering the characteristic of quantum parallelism, this paper further improves the searching process, which can be realized in only two steps, and presents the circuit implementation. In this scheme, the number of the quantum logic gates doesn＇t increase. Moreover, the losing-solution issue in the quantum binary searching algorithm can be efficiently prevented.

关 键 词：量子逻辑门 搜索算法 二进制 数据库检索 搜索过程 并行 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]