Extending the computational reach of Quantum Annealing using Reverse Annealing

2026-07-02

AI Summary

Current quantum annealing hardware suffers from noise and small energy gaps, leading to suboptimal performance on large-scale, complex combinatorial optimization problems. This work proposes a hybrid strategy that integrates forward and reverse annealing, systematically tuning the reverse annealing distance, pause duration, and total annealing time to significantly enhance solution quality and computational efficiency on the D-Wave Advantage system. Experimental results demonstrate that reverse annealing outperforms simply extending forward annealing, particularly for high-complexity instances, and reveal that its optimal parameter regime is closely tied to the freeze point and avoided level crossings. The approach consistently improves performance across diverse problem classes—including Max-Cut, number partitioning, and sparse clustering—with especially pronounced gains in scenarios where forward annealing alone is limited.

Abstract

Quantum annealing is a promising heuristic for combinatorial optimization, but on current hardware its performance degrades for larger and more complex problems due to noise and small energy gaps. Reverse annealing has been proposed as a refinement strategy, yet it remains unclear when it provides systematic advantages over standard forward annealing or simply increasing annealing time. We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes. The benefits of reverse annealing increase with problem complexity and are strongest in regimes where forward annealing is increasingly limited. Moreover, reverse annealing yields larger efficiency gains than simply extending forward annealing times. We establish these results through a systematic experimental study on a D-Wave Advantage system, benchmarking reverse annealing across Max-Cut, Number Partitioning, and sparse clustering problems while varying reverse distance, pause duration, and annealing time. We identify a narrow optimal regime for reverse annealing parameters linked to the location of freeze-out points and energy-level crossings in the annealing schedule. These findings demonstrate that reverse annealing is most valuable for large, high-complexity optimization problems and is likely to gain importance as quantum annealing hardware scales toward more realistic applications.

Problem

• Quantum Annealing
• Reverse Annealing
• Combinatorial Optimization
• Noise
• Energy Gaps

Innovation

• Reverse Annealing
• Quantum Annealing
• Combinatorial Optimization
• D-Wave Advantage
• Freeze-out Point