📝 SummarXiv

Abstract

The efficiency of adiabatic quantum evolution is governed by the adiabatic evolution time, \(T\), which depends on the minimum energy gap, \(\Delta\). For a generic schedule, \(T\) typically scales as \(\Delta^{-2}\), whereas the rigorous lower bound is \(\mathcal{O}(\Delta^{-1})\). This indicates the potential for a quadratic speedup through the adiabatic schedule construction. Here, we introduce the constant speed schedule, which traverses the adiabatic path of the eigenstate at a uniform rate. We first show that this approach reduces the scaling of the upper bound of the required evolution time by one order in \(1/\Delta\). We then provide a segmented constant speed schedule protocol, in which path segment lengths are computed from eigenstate overlaps along the adiabatic evolution. By relying on the overlaps on the fly, our method eliminates the need for prior spectral knowledge. We test our algorithm numerically on the adiabatic unstructured search, the N$_2$ molecule, and the [2Fe-2S] cluster. In our numerical experiments, the method achieves the optimal \(1/\Delta\) scaling in a small gap region, thereby demonstrating a quadratic speedup over the standard linear schedule.