Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

APS

Quantum Monte Carlo simulations in continuous Euclidean time

U.‐J. Wiese

Published Mar 1, 1998• 0 citations
OpenAlex

Related papers

Simulations of discrete quantum systems in continuous euclidean time

Bernard B. Beard, U.‐J. Wiese

arXiv:cond-mat/9602164•Nuclear Physics B - Proceedings Supplements•Feb 1, 1997•24 citations

Floating Block Method for Quantum Monte Carlo Simulations

Avik Sarkar, Dean Lee, Ulf-G. Meißner

Quantum Monte Carlo simulations are powerful and versatile tools for the quantum many-body problem. In addition to the usual calculations of energies and eigenstate observables, quantum Monte Carlo simulations can in principle be used to build fast and accurate many-body emulators using eigenvector continuation or design time-dependent Hamiltonians for adiabatic quantum computing. These new applications require something that is missing from the published literature, an efficient quantum Monte Carlo scheme for computing the inner product of ground state eigenvectors corresponding to different Hamiltonians. In this work, we introduce an algorithm called the floating block method, which solves the problem by performing Euclidean time evolution with two different Hamiltonians and interleaving the corresponding time blocks. We use the floating block method and nuclear lattice simulations to build eigenvector continuation emulators for energies of ^{4}He, ^{8}Be, ^{12}C, and ^{16}O nuclei over a range of local and nonlocal interaction couplings. From the emulator data, we identify the quantum phase transition line from a Bose gas of alpha particles to a nuclear liquid.

arXiv:2306.11439•Physical Review Letters•Dec 14, 2023•11 citations

Quantum Monte Carlo Methods: Algorithms for Lattice Models

James E. Gubernatis, Naoki Kawashima, Philipp Werner

Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.

Cambridge University Press eBooks•Jan 31, 2016•237 citations

Quantum Monte Carlo Simulations

Matthias Troyer, Philipp Werner, Adolfo Avella +1 more

AIP conference proceedings•Jan 1, 2009•13 citations

Fermionic and Continuous Time Quantum Monte Carlo

Emanuel Gull, Matthias Troyer

Springer series in solid-state sciences•Jan 1, 2013•1 citation

Self-learning Monte Carlo method: Continuous-time algorithm

Yuki Nagai, Huitao Shen, Yang Qi +2 more

The self-learning Monte Carlo (SLMC) method speeds up the Monte Carlo simulation by designing and training an effective model to propose efficient global updates. We implement the continuous-time quantum Monte Carlo algorithm for quantum impurity models in the framework of SLMC. We introduce and train a diagram generating function (DGF) to model the probability distribution of field configurations in the continuous imaginary time at all orders of diagrammatic expansion. By using the DGF to propose global updates, we show that the self-learning continuous-time Monte Carlo method can significantly reduce the computational complexity of the simulation.

arXiv:1705.06724•Physical review. B./Physical review. B•Oct 3, 2017•64 citations
Quantum Monte Carlo simulations are powerful and versatile tools for the quantum many-body problem. In addition to the usual calculations of energies and eigenstate observables, quantum Monte Carlo simulations can in principle be used to build fast and accurate many-body emulators using eigenvector continuation or design time-dependent Hamiltonians for adiabatic quantum computing. These new applications require something that is missing from the published literature, an efficient quantum Monte Carlo scheme for computing the inner product of ground state eigenvectors corresponding to different Hamiltonians. In this work, we introduce an algorithm called the floating block method, which solves the problem by performing Euclidean time evolution with two different Hamiltonians and interleaving the corresponding time blocks. We use the floating block method and nuclear lattice simulations to build eigenvector continuation emulators for energies of ^{4}He, ^{8}Be, ^{12}C, and ^{16}O nuclei over a range of local and nonlocal interaction couplings. From the emulator data, we identify the quantum phase transition line from a Bose gas of alpha particles to a nuclear liquid.
Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.
The self-learning Monte Carlo (SLMC) method speeds up the Monte Carlo simulation by designing and training an effective model to propose efficient global updates. We implement the continuous-time quantum Monte Carlo algorithm for quantum impurity models in the framework of SLMC. We introduce and train a diagram generating function (DGF) to model the probability distribution of field configurations in the continuous imaginary time at all orders of diagrammatic expansion. By using the DGF to propose global updates, we show that the self-learning continuous-time Monte Carlo method can significantly reduce the computational complexity of the simulation.