1996/11/30 by Daniel A. Lidar, Ofer Biham · 4 citations
Mathematics · Physics and Astronomy · #Markov Chains and Monte Carlo Methods #Quantum many-body systems #Theoretical and Computational Physics #comp-gas #cond-mat #nlin.CG #quant-ph
paper · pdf · doi:10.1103/physreve.56.3661
published as Phys. Rev. E vol.56 (1997), p.3661 · 24 pages, 3 epsf figures, replaced with published and significantly revised version. More info available at http://www.fh.huji.ac.il/~dani/ and http://www.fiz.huji.ac.il/staff/acc/faculty/biham
openalex publication_date 1997/09/01 · arxiv created 1997/09/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.