Faster quantum walk search on a weighted graph

Search via Quantum Walk

Quantum random walk search on satisfiability problems

Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles tha...

Faster Together: Collective Quantum Search

Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search ...

Quantum Walk Based Search Algorithms

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...

A faster database search for quantum computing

We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...