Depth optimization of quantum search algorithms beyond Grover's algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Physical Review A"
DOI: 10.1103/physreva.101.032346
Abstract: Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale… read more here.
Keywords: depth optimization; quantum search; grover; search ... See more keywords
Optimality of spatial search via continuous-time quantum walks
Sign Up to like & getrecommendations! Published in 2020 at "Physical Review A"
DOI: 10.1103/physreva.102.032214
Abstract: One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)],… read more here.
Keywords: search; time; quantum search; via continuous ... See more keywords
Quantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise
Sign Up to like & getrecommendations! Published in 2019 at "Physical Review A"
DOI: 10.1103/physreva.99.022339
Abstract: Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near term. Adiabatic quantum computing, quantum annealing, computation… read more here.
Keywords: quantum; quantum search; quantum walk; adiabatic quantum ... See more keywords