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 (8)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum Search by Local Adiabatic Evolution
• A different kind of quantum search
• Energy and Efficiency of Adiabatic Quantum Search Algorithms
• Quantum search with resonances
• Quantum games via search algorithms
• Classical search algorithm with resonances in $\sqrt{N}$ cycles

Cited by in corpus (6)

• Observation of a prethermal discrete time crystal
• Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes
• Implementation of many-qubit Grover search with trapped ultracold ions
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution
• Hilbert Space Average Method and adiabatic quantum search
• Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics