|
|
 |
| |
|
|
|
New Quantum Algorithms using Multi-Qubit Interaction |
|
|
|
PP: 445-450 |
|
|
|
doi:10.18576/isl/100308
|
|
|
|
Author(s) |
|
|
|
E. El-Sanousy,
Mohamed Tolan,
Ibrahim A. Abouelsaad,
Ayman Abd-Elhamed,
H. F. Abdel-Hameed,
|
|
|
|
Abstract |
|
|
| Searching whether an item is stored in an unsorted database of N items is a crucial issue in nowadays real world, computer science and engineering, applications. The complexity of this problem is O(N) and speed up quadratically, O(√N), when using Grover’s algorithm if N = 2n , where n is the number of qubits that are used store the unsorted database. This letter shows that Grover’s algorithm is inefficient for unsorted quantum databases of size N < 2n items. In this letter, a novel quantum searching algorithm is proposed to check whether a given item is stored in a given unknown and unsorted database of N ≤ 2n such that these states, items, are stored in a weighted/uniform superposition. The proposed search algorithm accomplishes this operation in polynomial time.
|
|
|
|
|
|
|
|
