Quantum search by partial adiabatic evolution
arXiv:1007.1528 · doi:10.1103/PhysRevA.82.034304
Abstract
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the time complexity, which is , of the local adiabatic search algorithm\cite{Roland2002}, to .
References in corpus (11)
- Quantum Mechanics helps in searching for a needle in a haystack
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Search by Local Adiabatic Evolution
- Robustness of adiabatic quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Sufficiency Criterion for the Validity of the Adiabatic Approximation
- First-order transitions and the performance of quantum algorithms in random optimization problems
- Adiabatic Quantum Computation and Deutsch's Algorithm
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- From quantum circuits to adiabatic algorithms
- Adiabatic Quantum Computation with a 1D projector Hamiltonian