A necessary condition for quantum adiabaticity applied to the adiabatic Grover search

TL;DR

This paper adapts a recent necessary adiabaticity condition to estimate the runtime of the adiabatic Grover search algorithm, demonstrating it reproduces the known optimal square root scaling with database size.

Contribution

It applies a newly developed necessary adiabatic condition to the adiabatic Grover search, providing a lower bound that matches the known optimal runtime scaling.

Findings

Lower bound on run time reproduces √N scaling

Highlights the relevance of the new adiabatic condition for quantum algorithms

Demonstrates the condition's applicability to many-body systems

Abstract

Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401 (2017)]. Here we tailor this condition for estimating run times of quantum adiabatic algorithms. As an illustration, the condition is applied to the adiabatic algorithm for searching in an unstructured database (adiabatic Grover search algorithm). We find that thus obtained lower bound on the run time of this algorithm reproduces $\sqrt N$ scaling ($N$ being the number of database entries) of the explicitly known optimal run time. This observation highlights the merits of the new adiabatic condition and its potential relevance to adiabatic quantum computing.