Quantum Annealing with chaotic driver Hamiltonians

Abstract: Quantum annealing is a computational approach designed to leverage quantum fluctuations for solving large-scale classical optimization problems. Although incorporating standard transverse field (TF) terms in the annealing process can help navigate sharp minima, the potential for achieving a scalable quantum advantage for general optimization problems remains uncertain. Here, we examine the effectiveness of including chaotic quantum driver Hamiltonians in the annealing dynamics. Specifically, we investigate driver Hamiltonians based on a bosonic spin version of the Sachdev-Ye-Kitaev (SYK) model, which features a high degree of non-locality and non-commutativity. Focusing on MaxCut instances on regular graphs, we find that a considerable proportion of SYK model instances demonstrate significant speedups, especially for challenging graph configurations. Additionally, our analysis of time-to-solution scalings for the low autocorrelation binary sequence (LABS) problem suggests that SYK-type fluctuations can outperform traditional transverse field annealing schedules in large-scale optimization tasks.