Improvements on quantum binary searching algorithm
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 c...
        Saved in:
      
    
          | Published in | Optoelectronics letters Vol. 5; no. 5; pp. 391 - 392 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
        Heidelberg
          Tianjin University of Technology
    
        01.09.2009
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1673-1905 1993-5013  | 
| DOI | 10.1007/s11801-009-9168-6 | 
Cover
| Summary: | 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. | 
|---|---|
| Bibliography: | TP18 12-1370/TN TP38  | 
| ISSN: | 1673-1905 1993-5013  | 
| DOI: | 10.1007/s11801-009-9168-6 |