Simulated outperforms quantum reverse annealing in mean-field models
Christopher L. Baldwin
TL;DR
The paper interrogates whether Adiabatic Reverse Annealing (ARA) offers a quantum advantage by introducing a classical analogue, Simulated Reverse Annealing (SRA), and comparing their performance in a solvable mean-field $p$-spin model with a two-pattern Hopfield extension. Using a two-order-parameter mean-field analysis, the authors map the free-energy landscape and identify how fluctuations can merge local minima to create barrier-free paths from a marked state to the true ground state. Dynamics, via path-integral formalisms for both ARA and SRA, show that when a transition-free path exists, both protocols reach the ground state in $O(1)$ time, with SRA typically achieving it faster; crucially, there are parameter regimes where SRA succeeds while ARA fails. Overall, the study argues that SRA unambiguously outperforms ARA in the mean-field models considered, implying that quantum fluctuations are not essential to the mechanism and that classical fluctuation-driven approaches can mimic or exceed ARA's performance in these contexts, while outlining future directions to test these ideas on harder problems and in finite-temperature settings.
Abstract
Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) $p$-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.
