{"paper":{"title":"Quantum adiabatic optimization without heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Aike Liu, Brad Lackey, Kianna Wan, Michael Jarret","submitted_at":"2018-10-10T18:01:02Z","abstract_excerpt":"Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $\\gamma(s)$. Assuming the existence of an oracle $\\Gamma$ such that $\\gamma_\\min = \\Theta\\left(\\min_s\\Gamma(s)\\right)$, we provide an algorithm that reliably performs QAO in time $O\\left(\\gamma_\\min^{-1}\\right)$ with $O\\left(\\log(\\gamma_\\min^{-1})\\right)$ oracle queries, where $\\gamma_\\min = \\min_s \\gamma(s)$. Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that $\\|dH/ds\\| \\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04686","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}