How quantum is the speedup in adiabatic unstructured search?
Sign Up to like & getrecommendations! Published in 2019 at "Quantum Information Processing"
DOI: 10.1007/s11128-019-2281-y
Abstract: In classical computing, analog approaches have sometimes appeared to be more powerful than they really are. This occurs when resources, particularly precision, are not appropriately taken into account. While the same should also hold for… read more here.
Keywords: unstructured search; search; speedup adiabatic; adiabatic unstructured ... See more keywords
Depth scaling of unstructured search via quantum approximate optimization
Sign Up to like & getrecommendations! Published in 2024 at "Physical Review A"
DOI: 10.1103/physreva.110.012428
Abstract: Variational quantum algorithms have become the de facto model for current quantum computations. A prominent example of such algorithms -- the quantum approximate optimization algorithm (QAOA) -- was originally designed for combinatorial optimization tasks, but… read more here.
Keywords: quantum approximate; depth; unstructured search; approximate optimization ... See more keywords