Table of Contents
Fetching ...

When Does Quantum Annealing Outperform Classical Methods? A Gradient Variance Framework

Vishwajeet Ohal, Pierre Boulanger

Abstract

Based on our experimental findings, we propose the following decision framework for practitioners. Quantum annealing is recommended when the problem formulation QUBO exhibits a high gradient variance (greater than 0.3) and the energy landscape contains numerous thin barriers characterized by sharp peaks and narrow valleys. Additionally, quantum approaches are particularly suitable when classical methods are observed to get trapped in local minima, the problem size is manageable given hardware constraints (less than 5000 variables for pure quantum annealing), and the time overhead of approximately 10 seconds is acceptable for the application. In contrast, classical methods are recommended when the gradient variance is low (less than 0.2), indicating smooth landscapes where quantum tunneling provides little advantage. Classical approaches are also preferable when the problem size is small and classical solvers can provide nearly instantaneous results, when solution quality requirements are modest and local optima suffice, or when hardware access or cost is a limiting factor. For problems that exceed pure quantum capacity but possess a favorable landscape structure, hybrid approaches combining quantum and classical techniques are recommended. Such hybrid methods are particularly effective when decomposition quality can be verified and both solution quality and scalability are important considerations.

When Does Quantum Annealing Outperform Classical Methods? A Gradient Variance Framework

Abstract

Based on our experimental findings, we propose the following decision framework for practitioners. Quantum annealing is recommended when the problem formulation QUBO exhibits a high gradient variance (greater than 0.3) and the energy landscape contains numerous thin barriers characterized by sharp peaks and narrow valleys. Additionally, quantum approaches are particularly suitable when classical methods are observed to get trapped in local minima, the problem size is manageable given hardware constraints (less than 5000 variables for pure quantum annealing), and the time overhead of approximately 10 seconds is acceptable for the application. In contrast, classical methods are recommended when the gradient variance is low (less than 0.2), indicating smooth landscapes where quantum tunneling provides little advantage. Classical approaches are also preferable when the problem size is small and classical solvers can provide nearly instantaneous results, when solution quality requirements are modest and local optima suffice, or when hardware access or cost is a limiting factor. For problems that exceed pure quantum capacity but possess a favorable landscape structure, hybrid approaches combining quantum and classical techniques are recommended. Such hybrid methods are particularly effective when decomposition quality can be verified and both solution quality and scalability are important considerations.
Paper Structure (71 sections, 25 equations, 12 figures, 3 tables, 1 algorithm)

This paper contains 71 sections, 25 equations, 12 figures, 3 tables, 1 algorithm.

Figures (12)

  • Figure 1: Experimental validation of theoretical model (Equation \ref{['eq:tunneling_gradient']}). Left: Log quantum success probability vs. inverse gradient variance showing strong linear correlation ($R^2=0.90$) as predicted by WKB approximation. Fitted slope $\alpha \approx 2.1$ provides empirical estimate of the barrier-quantum parameter relationship. Vertical dashed line indicates critical threshold $\sigma_{\mathrm{critical}} = 0.3$ below which quantum advantage diminishes sharply. Right: Success probability vs. gradient variance showing exponential relationship and threshold behavior. Shaded regions indicate no advantage (red, $\sigma < 0.3$) and measurable advantage (green, $\sigma > 0.3$) regimes. Experimental data points show characteristic threshold transition predicted by theory.
  • Figure 2: 3D plot of the energy landscape of a synthetic QUBO problem for 16 variables
  • Figure 3: Performance on synthetic QUBO problems. Left: Residual energy vs. problem size showing QA and SA achieving best solutions for large problems. Right: Solver time showing exponential growth for classical methods beyond $n=32$ while quantum methods show more moderate scaling.
  • Figure 4: Residual energy vs. gradient variance for synthetic QUBO problems. Quantum annealing (QA) and simulated annealing (SA) show the best performance, with the gap between them increasing at higher gradient variance, suggesting quantum tunneling effects.
  • Figure 5: Max Cut problem performance. Left: Energy vs. problem size showing similar performance across all solvers except Gurobi. Right: Solver time comparison showing quantum methods have higher overhead but comparable scaling.
  • ...and 7 more figures