Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
量子物理
2007-05-23 v1
摘要
We 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.
引用
@article{arxiv.quant-ph/0201031,
title = {Quantum Adiabatic Evolution Algorithms versus Simulated Annealing},
author = {Edward Farhi and Jeffrey Goldstone and Sam Gutmann},
journal= {arXiv preprint arXiv:quant-ph/0201031},
year = {2007}
}
备注
16pp., 10 EPS figures, using BoxedEPS macros and LaTeX. Email correspondence to E. Farhi <[email protected]>