dorsal/arxiv
View SchemaQuantum Adiabatic Evolution Algorithms versus Simulated Annealing
| Authors | Edward Farhi, Jeffrey Goldstone, Sam Gutmann |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0201031 |
| URL | https://arxiv.org/abs/quant-ph/0201031 |
Abstract
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.
{
"annotation_id": "292452b1-8604-4f0a-a33c-b461290c7485",
"date_created": "2026-03-02T18:01:49.544000Z",
"date_modified": "2026-03-02T18:01:49.544000Z",
"file_hash": "cf61a0791a657fd9e529d0ec8eb06888245d641608f00a851dbb64236dc824e6",
"private": false,
"record": {
"abstract": "We explain why quantum adiabatic evolution and simulated annealing perform\nsimilarly in certain examples of searching for the minimum of a cost function\nof n bits. In these examples each bit is treated symmetrically so the cost\nfunction depends only on the Hamming weight of the n bits. We also give two\nexamples, closely related to these, where the similarity breaks down in that\nthe quantum adiabatic algorithm succeeds in polynomial time whereas simulated\nannealing requires exponential time.",
"arxiv_id": "quant-ph/0201031",
"authors": [
"Edward Farhi",
"Jeffrey Goldstone",
"Sam Gutmann"
],
"categories": [
"quant-ph"
],
"title": "Quantum Adiabatic Evolution Algorithms versus Simulated Annealing",
"url": "https://arxiv.org/abs/quant-ph/0201031"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0078e6e8-3390-4553-bb8b-522fd7b81c5d",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}