Construction of quantum computer is an enormously appealing task because of quantum computational potential to perform superfast quantum algorithms. Two classes of quantum logarithms illustrate the great theoretical promise of quantum computers. One is based on Shor’s Fourier transformation including quantum factoring [1], Deutsh-Jozsa logarithm [2] and so on, which are all exponential speedup ...

In this paper we will present a quantum algorithm which works very efficiently in case of multiple matches within the search space and in the case of few matches, the algorithm performs classically. This allows us to propose a hybrid quantum search engine that integrates Grover’s algorithm and the proposed algorithm here to have general performance better that any pure classical or quantum sear...

This paper presents a new inspired algorithm called Quantum Inspired Cuckoo Search Algorithm (QICSA). This one is new framework relying on Quantum Computing principles and Cuckoo Search algorithm. The contribution consists in defining an appropriate representation scheme in the cuckoo search algorithm that allows applying successfully on combinatorial optimization problems some quantum computin...

Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm will be presented. Selecting phase shifts of 1.825π in the standard amplitude amplification will make the technique perform better so as to get probability of success at least 98% in O ( √

This paper proposes a Hybrid Quantum Evolutionary Algorithm. Quantum computing is capable of processing huge numbers of quantum states simultaneously, in parallel, (“quantum parallelism”), whereas evolutionary computing can only process one chromosome per processor. In theory, QC ought to be able to process upto all possible points in a 2 search space (of N bit chromosomes). An evolutionary alg...

Quantum computers have the potential to out-perform classical computers—certain quantum algorithms run much faster than any known alternative classical algorithm. For example, Grover showed that a quantum computer can search an unordered list ofN items in timeO( √ N), providing a quadratic speed-up over the classical algorithm. In this paper, we show that we can modify Grover’s search algorithm...

We introduce an algorithm for combinatorial search on quantum computers that is capable of signiicantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem structure as used by classical backtrack methods to avoid unproductive search choices. This quantum algorithm is much more likely to nd solutions than the sim...