Enhancement of quantum annealing via n-local catalysts
Roopayan Ghosh, Luca A. Nutricati, Natasha Feinstein, P. A. Warburton, Sougato Bose
TL;DR
This work tackles the bottleneck of exponentially small energy gaps in adiabatic quantum annealing for NP-hard MWIS problems. It introduces n-local catalysts, including a universal product catalyst and locality-graded multi-qubit terms, to transform first-order phase transitions into crossovers and dramatically improve gap scaling. Through toy models and random-graph MWIS instances, it demonstrates that carefully placed 2- to 3- and higher-local couplings can open the gap and enhance ground-state preparation, with stoquastic catalysts offering systematic improvements in many cases. Gate-based implementations show that these catalysts can be realized with polynomially bounded circuit depth and substantially fewer gates than traditional discrete-time drivers, implying practical resource reductions for quantum annealing. The findings point to non-local quantum fluctuations as a key ingredient for achieving quantum advantage in optimization tasks and provide a scalable, adaptive framework for catalyst design.
Abstract
The potential quantum speedup in solving optimization problems via adiabatic quantum annealing is often hindered by the closing of the energy gap during the anneal, especially when this gap scales exponentially with system size. In this work, we alleviate this bottleneck by demonstrating that for the NP-complete Maximum Weighted Independent Set (MWIS) problem, an informed choice of $n-$local catalysts (operators involving $n$ qubits) can re-open the gap during the annealing process. By analyzing first-order phase transitions in toy instances of the MWIS problem, we first identify direct-tunneling catalysts that effectively eliminate the transition and provide an analytical discussion on when the sign of the catalyst influences its impact. We then reveal that $n-$local catalysts exponentially improve gap scaling and in certain scenarios are as effective as direct tunnel coupling between two minima. Utilizing this understanding, we show that they also increase the efficiency of ground state preparation via adiabatic quantum annealing in random graphs and analytically demonstrate the necessity of their placement across unfrustrated loops in the graph for effective performance in MWIS problems. Additionally, using a circuit implementation of the $n$-local catalyst (requiring $2n$ nearest-neighbour gates), we demonstrate that both the circuit depth and the total number of gates required to solve the problem are reduced by several orders of magnitude when compared to the discrete-time version of traditional quantum annealing using local drivers. Our analysis suggests that non-local quantum fluctuations entangling multiple qubits as a catalyst are key to achieving the desired quantum advantage.
