Mitigating small gaps in quantum annealing through recursive XX−catalyst construction
Abstract
The introduction of XX−interactions, typically in the form of an additional catalyst Hamiltonian, has shown promise as a tool for gap enhancement in quantum annealing, allowing the algorithm to obtain optimal solutions with shorter run-times. However, the optimal placements of these couplings within the problem graph has been found to be highly setting-dependent. In this work, we propose an iterative catalyst-construction protocol for the removal of a common quantum annealing bottleneck known as perturbative crossings. The method utilises the measurements returned by successive annealing runs to effectively steer the algorithm away from the local optima in which it becomes trapped. First, we motivate a framework for XX−term selection based on perturbation theory and establish its effectiveness at removing perturbative crossings on scalable toy instances with up to $39$ spins, demonstrating a consistent performance both with increasing system size and number of local optima. We then simulate the recursive catalyst-construction method on a test set of 18−spin maximum-weight independent set problems that are generated to produce annealing spectra with multiple perturbative crossings. We find that the protocol significantly outperforms both catalyst-free annealing and annealing with catalysts containing randomly selected XX−terms.
Related
- Graph construction in QUBO-based recursive phylogenetic tree reconstruction
- Reverse Quantum Annealing for Ground-State Energy Calculation in Molecule
- Swapping Quantum Annealing Errors into a Cavity
- Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing
- Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition
BibTeX
@misc{feinstein2026mitigating,
title = {{Mitigating small gaps in quantum annealing through recursive $XX-$catalyst construction}},
author = {Natasha Feinstein and Sebastian Schulz and Robert J. Banks and Roopayan Ghosh and Kristel Michielsen and Sougato Bose and P A Warburton},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04840},
eprint = {2611.04840},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04840},
}
RIS
TY - UNPB
TI - Mitigating small gaps in quantum annealing through recursive XX−catalyst construction
AU - Natasha Feinstein
AU - Sebastian Schulz
AU - Robert J. Banks
AU - Roopayan Ghosh
AU - Kristel Michielsen
AU - Sougato Bose
AU - P A Warburton
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.04840
UR - https://arxiv.org/abs/2611.04840
AB - The introduction of XX−interactions, typically in the form of an additional catalyst Hamiltonian, has shown promise as a tool for gap enhancement in quantum annealing, allowing the algorithm to obtain optimal solutions with shorter run-times. However, the optimal placements of these couplings within the problem graph has been found to be highly setting-dependent. In this work, we propose an iterative catalyst-construction protocol for the removal of a common quantum annealing bottleneck known as perturbative crossings. The method utilises the measurements returned by successive annealing runs to effectively steer the algorithm away from the local optima in which it becomes trapped. First, we motivate a framework for XX−term selection based on perturbation theory and establish its effectiveness at removing perturbative crossings on scalable toy instances with up to $39$ spins, demonstrating a consistent performance both with increasing system size and number of local optima. We then simulate the recursive catalyst-construction method on a test set of 18−spin maximum-weight independent set problems that are generated to produce annealing spectra with multiple perturbative crossings. We find that the protocol significantly outperforms both catalyst-free annealing and annealing with catalysts containing randomly selected XX−terms.
ER -