Vanilla Adiabatic Quantum Optimization Can Have Subexponential Advantage

We construct a family of objective functions $f \colon \{0,1\}^n \to \mathbb{R}$ for which vanilla adiabatic quantum optimization along $H(s) = -(1-s)\sum_{i=1}^n X_i + s\sum_x f(x)\lvert x\rangle\!\langle x\rvert$ finds the global minimizer in $\operatorname{poly}(n)$ time, whereas any classical algorithm requires $\exp(n^{Ω(1)})$ time to do so in the black-box model. Our result is achieved by replacing the linearization technique in an earlier work of Leng et al. (arXiv:2504.14841), which establishes a similar subexponential quantum speedup using a transverse field Ising mixer rather than $-\sum_{i=1}^n X_i$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24035
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Vanilla Adiabatic Quantum Optimization Can Have Subexponential Advantage

Yufan Zheng
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Vanilla Adiabatic Quantum Optimization Can Have Subexponential Advantage

Yufan Zheng
preprint en

Abstract

We construct a family of objective functions $f \colon \{0,1\}^n \to \mathbb{R}$ for which vanilla adiabatic quantum optimization along $H(s) = -(1-s)\sum_{i=1}^n X_i + s\sum_x f(x)\lvert x\rangle\!\langle x\rvert$ finds the global minimizer in $\operatorname{poly}(n)$ time, whereas any classical algorithm requires $\exp(n^{Ω(1)})$ time to do so in the black-box model. Our result is achieved by replacing the linearization technique in an earlier work of Leng et al. (arXiv:2504.14841), which establishes a similar subexponential quantum speedup using a transverse field Ising mixer rather than $-\sum_{i=1}^n X_i$.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon