We consider the problem of search of an unstructured list for a marked element x, when one is given advice as to where x might be located, in the form of a probability distribution. The goal is to minimise the expected number of queries to the list made to find x, with respect to this distribution. We present a quantum algorithm which solves this problem using an optimal number of queries, up t...

We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [1], which rely on building spe...

The general approach for quantum algorithm (QA) simulation on classical computer is introduced. Efficient fast algorithm and corresponding SW for simulation of Grover's quantum search algorithm (QSA) in large unsorted database and fuzzy simulation is presented. Comparison with common QA simulation approach is demonstrated. Hardware (HW) design method of main quantum operators that are used in s...

Real parallel computing is possible with a quantum computer which makes use of quantum states (Nielsen & Chuang, 2000). It is well known that a quantum computation algorithm for factorization discovered by Shor (1994) is faster than any classical algorithm. Also a quantum algorithm for database search in ( ) O N quantum computation steps instead of O(N) classical steps has been proposed by Grov...

In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the que...

Some classical solutions to problems achieve particular speed ups when we allow those algorithms to become quantum based. The most obvious result is the ability to search a group of n elements in sub linear time. Classically, it is required to look at all of the elements, one at a time, to ensure that the marked item is or is not present. In the quantum world, thanks to Lov Grover [4], we can d...

Gravitational search algorithm (GSA) is a swarm intelligence optimization algorithm that shares many similarities with evolutionary computation techniques. However, the GSA is driven by the simulation of a collection of masses which interact with each other based on the Newtonian gravity and laws of motion. Inspired by the classical GSA and quantum mechanics theories, this work presents a novel...

Hybridizing chaotic evolutionary algorithms with support vector regression (SVR) to improve forecasting accuracy is a hot topic in electricity load forecasting. Trapping at local optima and premature convergence are critical shortcomings of the tabu search (TS) algorithm. This paper investigates potential improvements of the TS algorithm by applying quantum computing mechanics to enhance the se...

The Quantum Computer Emulator (QCE) described in this paper consists of a simulator of a generic, general purpose quantum computer and a graphical user interface. The latter is used to control the simulator, to define the hardware of the quantum computer and to debug and execute quantum algorithms. QCE runs in a Windows 98/NT/2000/ME/XP environment. It can be used to validate designs of physica...