dorsal/arxiv
View SchemaSimulating Ising Spin Glasses on a Quantum Computer
| Authors | Daniel A. Lidar, Ofer Biham |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9611038 |
| URL | https://arxiv.org/abs/quant-ph/9611038 |
| DOI | 10.1103/PhysRevE.56.3661 |
| Journal | Phys. Rev. E vol.56 (1997), p.3661 |
Abstract
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down, nor gets stuck in local minima. The algorithm can be A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down, nor gets stuck in local minima. The algorithm can be applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field. applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field.
{
"annotation_id": "900200d3-971c-4df6-bc7b-df9bf9b8de90",
"date_created": "2026-03-02T18:02:37.844000Z",
"date_modified": "2026-03-02T18:02:37.844000Z",
"file_hash": "f041a1a83d6f4a823b7e7a704d82d8d6f2e2ac72b1e4aaa2a4fc3ffee26cf8ac",
"private": false,
"record": {
"abstract": "A linear-time algorithm is presented for the construction of the Gibbs\ndistribution of configurations in the Ising model, on a quantum computer. The\nalgorithm is designed so that each run provides one configuration with a\nquantum probability equal to the corresponding thermodynamic weight. The\npartition function is thus approximated efficiently. The algorithm neither\nsuffers from critical slowing down, nor gets stuck in local minima. The\nalgorithm can be A linear-time algorithm is presented for the construction of\nthe Gibbs distribution of configurations in the Ising model, on a quantum\ncomputer. The algorithm is designed so that each run provides one configuration\nwith a quantum probability equal to the corresponding thermodynamic weight. The\npartition function is thus approximated efficiently. The algorithm neither\nsuffers from critical slowing down, nor gets stuck in local minima. The\nalgorithm can be applied in any dimension, to a class of spin-glass Ising\nmodels with a finite portion of frustrated plaquettes, diluted Ising models,\nand models with a magnetic field. applied in any dimension, to a class of\nspin-glass Ising models with a finite portion of frustrated plaquettes, diluted\nIsing models, and models with a magnetic field.",
"arxiv_id": "quant-ph/9611038",
"authors": [
"Daniel A. Lidar",
"Ofer Biham"
],
"categories": [
"quant-ph",
"comp-gas",
"cond-mat",
"nlin.CG"
],
"doi": "10.1103/PhysRevE.56.3661",
"journal_ref": "Phys. Rev. E vol.56 (1997), p.3661",
"title": "Simulating Ising Spin Glasses on a Quantum Computer",
"url": "https://arxiv.org/abs/quant-ph/9611038"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3edde8af-1364-4452-8269-935c629f9aaa",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}