Quantum Adiabatic Evolution Algorithms versus Simulated Annealing

Simple item page
dc.creatorFarhi, Edward
dc.creatorGoldstone, Jeffrey
dc.creatorGutmann, Sam
dc.date2002-01-08
dc.date.accessioned2026-07-07T06:03:30Z
dc.date.available2026-07-07T06:03:30Z
dc.descriptionWe explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adiabatic algorithm succeeds in polynomial time whereas simulated annealing requires exponential time.
dc.description16pp., 10 EPS figures, using BoxedEPS macros and LaTeX. Email correspondence to E. Farhi <farhi@mit.edu>
dc.identifierhttps://arxiv.org/abs/quant-ph/0201031
dc.identifierhttp://arxiv.org/abs/quant-ph/0201031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89964
dc.subjectQuantum Physics
dc.titleQuantum Adiabatic Evolution Algorithms versus Simulated Annealing
dc.typetext

Files

Collections

arXiv