Non adiabatic quantum search algorithms

Abstract

We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.

7 pages, 5 figures

References in corpus (2)

• Quantum games via search algorithms
• Classical search algorithm with resonances in $\sqrt{N}$ cycles

Cited by in corpus (2)

• Implementation of many-qubit Grover search with trapped ultracold ions
• Hilbert Space Average Method and adiabatic quantum search