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

Journal of Experimental and Theoretical Physics

Effective quantum Monte Carlo algorithm for modeling strongly correlated systems

V. А. Kashurnikov, Andrey V. Krasavin

Published Jul 1, 2007• 8 citations
Publisher

Abstract

A new effective Monte Carlo algorithm based on principles of continuous time is presented. It allows calculating, in an arbitrary discrete basis, thermodynamic quantities and linear response of mixed boson-fermion, spin-boson, and other strongly correlated systems which admit no analytic description
DOI
10.1134/s1063776107070163

Related papers

Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models

Mauro Iazzi, Matthias Troyer

Efficient continuous-time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state of the art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, nor other fermionic lattice systems due to a suboptimal scaling of $O({\ensuremath{\beta}}^{3})$ with inverse temperature $\ensuremath{\beta}$, compared to the linear scaling of discrete-time algorithms. Here we present a CT-QMC algorithm for fermionic lattice systems that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. This provides an efficient simulation scheme that is free from the systematic errors opening an avenue to more precise studies of large systems at low and zero temperature.

arXiv:1411.0683•Physical Review B•Jun 30, 2015•35 citations

Generalized Quantum Monte Carlo Algorithm in Eigen Basis

V. А. Kashurnikov, Andrey V. Krasavin, Yaroslav Zhumagulov +1 more

Abstract New generalized continuous-time quantum Monte Carlo algorithm is developed. The algorithm is absolutely universal in the sense that it allows to calculate models specified in an arbitrary basis (in the basis of occupation numbers; in the momentum representation; in the basis of the eigenfunctions of small clusters into which the entire system is divided, or in any other basis): the algorithm requires only the specification of the matrix elements between the basis functions defined in a convenient basis. The implemented algorithm is applied to one-dimensional Hubbard model.

Journal of Physics Conference Series•Nov 1, 2019•0 citations

Quantum Monte Carlo in the Age of Many-Body Quantum Information

Yi-Ming Ding, Bin-Bin Mao, Zheng Yan

Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been extended beyond the measurement of conventional linear observables. This review summarizes recent progress in adapting QMC to many-body quantum-information, focusing on qubit or spin-$1/2$ systems as a concrete setting while keeping the discussion broadly applicable to qudit and bosonic systems. We present a unified perspective on the extraction of nonlinear diagnostics, including entanglement entropies and entanglement spectra, Rényi negativities for mixed-state entanglement, stabilizer entropies for quantum magic, and decoherence-driven phenomena such as the interplay between imaginary-time evolution and decoherence and strong-to-weak spontaneous symmetry breaking.

quant-pharXiv:2608.23231•Aug 25, 2026•2 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

Efficient continuous-time quantum Monte Carlo method for the ground state of correlated fermions

Lei Wang, Mauro Iazzi, Philippe Corboz +1 more

While efficient algorithms exist for the simulation of bosons simulations of fermions are more challenging because of the infamous fermion sign problem. In this paper the authors take a step toward solution and develop continuous-time quantum Monte Carlo algorithm for lattice fermions that scales linearly with projection time and interaction strength. This method is benchmarked on the problem of the fermionic quantum critical point of spinless fermions on a honeycomb lattice.

arXiv:1501.00986•Physical Review B•Jun 30, 2015•34 citations

Quantum Monte Carlo Approaches for Tackling Electronic Correlation

Massimo Mella, Gabriele Morosi

Quantum Monte Carlo (QMC) methods sample the wave function, in principle the exact one, instead of optimizing analytical functions as standard ab initio approaches. They have emerged as suitable alternative to ab initio methods to deal with the dynamical correlation in the description of the electronic structure of atoms and molecules. Differently from standard quantum chemistry approaches, QMC enjoys several features that make it the method of choice for complicated systems. Among these features, it is important to notice its intrinsically parallelizable nature, the slow (˜N 3 ) scaling of the computational cost with number of particles N, the limited amount of memory required and its ability to deal with substantially different systems within the same theoretical/algorithmic structure (e.g. it can be easily applied to both bosons and fermions, to the description of systems containing electrons and positrons as well as of vibrational properties of molecules). One of the strongest points characterizing QMC is the fact that it may use any kind of basis sets, albeit uncommon ones, depending on the species. This fact allows QMC either to quickly converge to the exact answer in the case of bosonic systems, or to easily recover 90–95% of the correlation energy in electronic species without the inverse cubic convergence with respect to the size of the basis set that plagues more common ab initio methods. Thanks to these characteristics, different flavours of QMC have been applied to a wide set of species/problems spanning a range that stretches from molecules as small as water up to pieces of bulk matter as large as silicon and germanium crystals and that includes molecules such as porphyrins and C 20 . Despite the strong points highlighted, QMC suffers from a relatively high computational cost mainly due to the necessity of evaluating many times a reference wave function. Thus, a substantial reduction of this cost may come from central processing units (CPU) particularly tailored to compute exponentials, polynomials and rational functions, from better algorithms that require less function evaluations and from variance reduction techniques. Besides, more robust approaches to reduce the so called “nodal error” would help improve the already appreciable accuracy afforded by QMC. With the above issues improved, there are several avenues that would become possible to pursue on a routine basis. Among these, we foresee the calculations of intermolecular interactions for very large systems (e.g. parts of DNA with or without interacting species), the calculation of nuclear magnetic resonance (NMR) parameters for difficult systems, the automatic optimization of molecular structures and, even better, the chance of running molecular dynamics simulation à la Car–Parrinello using QMC computed atomic forces. In these circumstances, the study of phase transitions, bulk matter, interfaces and large biological systems may reach an unexpected level of accuracy that is currently unavailable due to methodological limitations.

IMPERIAL COLLEGE PRESS eBooks•Aug 1, 2011•0 citations
Efficient continuous-time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state of the art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, nor other fermionic lattice systems due to a suboptimal scaling of $O({\ensuremath{\beta}}^{3})$ with inverse temperature $\ensuremath{\beta}$, compared to the linear scaling of discrete-time algorithms. Here we present a CT-QMC algorithm for fermionic lattice systems that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. This provides an efficient simulation scheme that is free from the systematic errors opening an avenue to more precise studies of large systems at low and zero temperature.
Abstract New generalized continuous-time quantum Monte Carlo algorithm is developed. The algorithm is absolutely universal in the sense that it allows to calculate models specified in an arbitrary basis (in the basis of occupation numbers; in the momentum representation; in the basis of the eigenfunctions of small clusters into which the entire system is divided, or in any other basis): the algorithm requires only the specification of the matrix elements between the basis functions defined in a convenient basis. The implemented algorithm is applied to one-dimensional Hubbard model.
Quantum Monte Carlo (QMC) methods are among the central numerical tools for studying strongly correlated quantum many-body systems, particularly in higher dimensions. As quantum information has introduced new information-theoretic perspectives and diagnostics into many-body physics, QMC methods have accordingly been extended beyond the measurement of conventional linear observables. This review summarizes recent progress in adapting QMC to many-body quantum-information, focusing on qubit or spin-1/21/21/2 systems as a concrete setting while keeping the discussion broadly applicable to qudit and bosonic systems. We present a unified perspective on the extraction of nonlinear diagnostics, including entanglement entropies and entanglement spectra, Rényi negativities for mixed-state entanglement, stabilizer entropies for quantum magic, and decoherence-driven phenomena such as the interplay between imaginary-time evolution and decoherence and strong-to-weak spontaneous symmetry breaking.
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.
Quantum Monte Carlo (QMC) methods sample the wave function, in principle the exact one, instead of optimizing analytical functions as standard ab initio approaches. They have emerged as suitable alternative to ab initio methods to deal with the dynamical correlation in the description of the electronic structure of atoms and molecules. Differently from standard quantum chemistry approaches, QMC enjoys several features that make it the method of choice for complicated systems. Among these features, it is important to notice its intrinsically parallelizable nature, the slow (˜N 3 ) scaling of the computational cost with number of particles N, the limited amount of memory required and its ability to deal with substantially different systems within the same theoretical/algorithmic structure (e.g. it can be easily applied to both bosons and fermions, to the description of systems containing electrons and positrons as well as of vibrational properties of molecules). One of the strongest points characterizing QMC is the fact that it may use any kind of basis sets, albeit uncommon ones, depending on the species. This fact allows QMC either to quickly converge to the exact answer in the case of bosonic systems, or to easily recover 90–95% of the correlation energy in electronic species without the inverse cubic convergence with respect to the size of the basis set that plagues more common ab initio methods. Thanks to these characteristics, different flavours of QMC have been applied to a wide set of species/problems spanning a range that stretches from molecules as small as water up to pieces of bulk matter as large as silicon and germanium crystals and that includes molecules such as porphyrins and C 20 . Despite the strong points highlighted, QMC suffers from a relatively high computational cost mainly due to the necessity of evaluating many times a reference wave function. Thus, a substantial reduction of this cost may come from central processing units (CPU) particularly tailored to compute exponentials, polynomials and rational functions, from better algorithms that require less function evaluations and from variance reduction techniques. Besides, more robust approaches to reduce the so called “nodal error” would help improve the already appreciable accuracy afforded by QMC. With the above issues improved, there are several avenues that would become possible to pursue on a routine basis. Among these, we foresee the calculations of intermolecular interactions for very large systems (e.g. parts of DNA with or without interacting species), the calculation of nuclear magnetic resonance (NMR) parameters for difficult systems, the automatic optimization of molecular structures and, even better, the chance of running molecular dynamics simulation à la Car–Parrinello using QMC computed atomic forces. In these circumstances, the study of phase transitions, bulk matter, interfaces and large biological systems may reach an unexpected level of accuracy that is currently unavailable due to methodological limitations.