Simulating ising spin glasses on a quantum computer

Daniel A. Lidar, Ofer Biham

Research output: Contribution to journalArticlepeer-review

81 Scopus citations


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.

Original languageAmerican English
Pages (from-to)3661-3681
Number of pages21
JournalPhysical Review E
Issue number3
StatePublished - 1997


Dive into the research topics of 'Simulating ising spin glasses on a quantum computer'. Together they form a unique fingerprint.

Cite this