arXiv:2610.11262
Gap Sensitivity and Bottleneck Migration in Sparse Constraint-Preserving Quantum Annealing
Aruna Gupta, S. R. Hassan
Abstract
Constraint-preserving exchange drivers allow many coupling graphs that preserve the same feasible sector, but exhibit different minimum gaps along an annealing path. We derive an exchange-resolved sensitivity of the normalised minimum gap for fixed-cardinality Laplacian drivers sharing a Dicke ground state, and apply it to identify locally favourable modifications of the driver. Numerical experiments indicate this sensitivity reliably predicts beneficial infinitesimal changes, but its reliability decreases when the same direction is extended to a finite edge replacement. The gap landscape tracking reveals one mechanism of this loss of reliability. Improving the active bottleneck can expose a competing minimum, with a more extensive reorganisation of the low-energy subspace. We call this the "repair-and-expose" mechanism and observe it in both dense quadratic and sparse frustrated objective families. This motivates relinearizing the response when competing minima become co-active. In the tested oracle setting, a tied-minimum max-min update is substantially more reliable than continuing the original direction or optimizing only the incoming minimum. Supporting finite-size search and selector tests show that this local information can remain useful beyond the infinitesimal limit, while its practical extraction depends on the driver geometry and identification of the relevant low-energy competitors. These results connect local exchange-resolved gap sensitivity to bottleneck migration and conditional driver redirection.
AI Summary
The paper asks how changing the exchange graph of a fixed-cardinality, constraint-preserving annealing driver affects the minimum gap when connected drivers share the same Dicke ground state. It studies Laplacian drivers normalized by their sector bandwidth. Using Hellmann–Feynman and envelope arguments, it derives an exchange-resolved minimum-gap derivative: a ground–excited-state Dirichlet-energy contrast with a bandwidth-normalization correction. At tied minima, the directional response is the minimum response across active branches, motivating max–min relinearization. Numerical tests primarily use 30 dense quadratic objectives at $N=6$, $K=3$, with five edge budgets and 900 starting records. Of these, 798 admit an oracle-selected positive direction; all improve the re-minimized gap at step sizes $10^{-3}$ and $10^{-2}$, but only 662/798 (82.96%) improve after complete edge replacement. Resolved bottleneck switching occurs on 421/798 paths; 420 first switches occur above the initial gap, illustrating “repair-and-expose.” At 279 interior switching events, protecting all active minima improves 278 cases and abstains once, whereas continuing the original direction harms 171. A second, sparse frustrated family reproduces the qualitative mechanism, with switching on 188/809 paths. Supporting exhaustive search finds modest sensitivity-guided advantages over candidate-evaluation-matched random search at larger tested budgets; classical selectors perform inconsistently. The stated scope is finite-size mechanism identification: exact normalization, oracle eigenstates, numerical gap location, and conditioned selector samples limit practical conclusions. The results do not establish scalable driver design, global convergence, finite-time speedup, or quantum advantage.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.