1301.4956 (Itay Hen)

How Fast Can Quantum Annealers Count?    [PDF]

Itay Hen

We outline an algorithm for an efficient solution of the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is solved as efficiently as the analogous circuit-based algorithm, i.e., quadratically faster than the corresponding classical algorithm. The above algorithm provides further evidence for the potentially powerful capabilities of AQC as a paradigm for efficient problem solving on a quantum computer. We also discuss the algorithm in relation to the problem of Quantum Phase Detection.

View original: http://arxiv.org/abs/1301.4956