Quantum computing and quantum search algorithms

Jamal S. Rahhal, Dia I. Abualnadi, Mohammed Hawa

Quantum computing promises a leap in performance over classical computing. Its computational power was revealed after the introduction of some quantum algorithms such as Grover's search algorithm. Many classical algorithms especially that deal with Error Correcting Codes are introduced to solve an exhaustive search problem. The quantum techniques promise an optimal search speed that is of special importance when the size of the searched domain is quite large. In this paper we devise the use of quantum search algorithm introduced by Grover to implement the viterbi algorithm (VA). Due to lack of resources and the nature of implementing quantum algorithms, only theoretical results are obtained. The use of quantum search algorithm showed that we can reduce the number of search computations exponentially. For example if the classical VA requires 262144 searching operations for a signalling length of 1024 intervals, the quantum algorithm will need only 512 searching operations when single search quantum viterbi algorithm (SSQVA) is used. And for the multi search quantum viterbi algorithm (MSQVA) it needs 16384 searching operations for the same signalling length.

Christoph Dürr, xb b b

Uwe Schöning, Randall J. Pruim

Hooman Sherkat-Massoom

Quantum computing is a system of computation that exploits the quantum-mechanical nature of reality at nano-scales in order to perform certain operations in a way that can scale better than is possible with classical computing. While the hardware sideof quantum computing is still in its infancy, many quantum algorithms - sets of instructions to run on a quantum computer in order to complete particular tasks - have been designed and analyzed. One of the most famous of these is Grover’s algorithm, an algorithm for searching a database. Two types of generalizations of Grover’s algorithm have been studied: spatial search algorithms (algorithms for searching discrete spaces) and “analog” search algorithms (algorithms performed by the evolution of physical systems). We develop and analyze algorithms that are generalizations of both those generalizations – an analog search algorithm for searching continuous, rather than discrete, spaces.

Jiayu Zhuang, Junsuo Zhao, Fanjiang Xu +2 more

A quantum computation problem of quantum search is discussed in this paper.Grover's search algorithm, the most commonly used quantum search algorithm, is introduced in details.The flow of quantum search algorithm and the quantum circuit model are shown.And the error of the search value, as well as the probability of measurement, is analyzed.For further research we simulated the Grover's search algorithm in classical computer.By quantum simulator the probability distribution of the measuring result of search value is presented and the computational efficiency is discussed.The simulation result demonstrates the effectiveness of the proposed algorithm.

Author 1 - Mr. K. Suresh Babu Author 2 : Dr. T. P. Anish Author 3 : Dr. Cornelius K