How Fast Can Quantum Annealers Count?

TL;DR

This paper presents an adiabatic quantum algorithm for counting that achieves quadratic speedup over classical methods, demonstrating the potential of AQC for efficient quantum problem solving.

Contribution

It introduces a local adiabatic evolution approach for quantum counting, matching the efficiency of circuit-based algorithms and highlighting AQC's capabilities.

Findings

Quantum counting solved with quadratic speedup

Local adiabatic evolution matches circuit-based complexity

Supports AQC as a powerful paradigm for quantum algorithms

Abstract

We outline an algorithm for 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 with the same complexity 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 more efficient problem solving on a quantum computer, and may be used as the basis for solving more sophisticated problems.