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

Applied Mathematical Modelling

What Monte Carlo models can do and cannot do efficiently?

Emanouil I. Atanassov, Ivan Dimov

Published Jul 5, 2007• 35 citations
Publisher
DOI
10.1016/j.apm.2007.04.010

Related papers

Extending Monte Carlo samples

Bernard B. Beard

Nuclear Physics B - Proceedings Supplements•May 1, 2003•1 citation

Self-learning Monte Carlo with deep neural networks

Huitao Shen, Junwei Liu, Liang Fu

The self-learning Monte Carlo (SLMC) method is a general algorithm to speedup MC simulations. Its efficiency has been demonstrated in various systems by introducing an effective model to propose global moves in the configuration space. In this paper, we show that deep neural networks can be naturally incorporated into SLMC, and without any prior knowledge can learn the original model accurately and efficiently. Demonstrated in quantum impurity models, we reduce the complexity for a local update from $O({\ensuremath{\beta}}^{2})$ in Hirsch-Fye algorithm to $O(\ensuremath{\beta}ln\ensuremath{\beta})$, which is a significant speedup especially for systems at low temperatures.

arXiv:1801.01127•Physical review. B./Physical review. B•May 29, 2018•83 citations

On the Power of Restricted Monte Carlo Algorithms

Stefan Heinrich

MATRIX book series•Jan 1, 2020•3 citations

Monte Carlo Shell Model Calculations for Atomic Nuclei and Their Parallel Computing

Takaharu Otsuka, Noritaka Shimizu, Seigo Haruyama +5 more

The Quantum Monte Carlo Diagonalization method for solving quantum many-body problems has been proposed, and its applications to the nuclear shell model have been extensively developed. This application is called Monte Carlo Shell Model. The actual numerical calculations of Monte Carlo Shell Model can be carried out very efficiently by a massive parallel computer, and indeed we have introduced one called Alphleet to RIKEN recently. A brief sketch of the Monte Carlo Shell Model and its parallel computing are presented.

Progress of Theoretical Physics Supplement•Jan 1, 2000•3 citations

Strategies for Quasi-Monte Carlo

Bennett L. Fox

International series in management science/operations research/International series in operations research & management science•Jan 1, 1999•115 citations

Self-Learning Monte Carlo Method in Fermion Systems

Zi Yang Meng, Liang Fu, Junwei Liu +2 more

As a new general-purpose Monte Carlo method, self-learning Monte Carlo (SLMC) has been numerically demonstrated in boson systems. In this work, we propose a new type of update algorithm, dubbed cumulative update, which could be naturally integrated into SLMC. Based on many local updates in the self-learned effective model, cumulative update efficiently proposes a global move with a high acceptance probability in the original model. Cumulative update can reduce the conventional computational cost of a full sweep O(N4) to O(N3), and also effectively reduce the auto-correlation time to be 1. We numerically show its efficiency through the well-known double-exchange model. With cumulative update, the SLMC could be several hundreds of times faster than the conventional local update method. By employing the cumulative update, SLMC can be generally used in any sign-problem-free Fermion systems and maximize the performance of Monte Carlo simulation.

•Jan 1, 2017•0 citations
The self-learning Monte Carlo (SLMC) method is a general algorithm to speedup MC simulations. Its efficiency has been demonstrated in various systems by introducing an effective model to propose global moves in the configuration space. In this paper, we show that deep neural networks can be naturally incorporated into SLMC, and without any prior knowledge can learn the original model accurately and efficiently. Demonstrated in quantum impurity models, we reduce the complexity for a local update from $O({\ensuremath{\beta}}^{2})$ in Hirsch-Fye algorithm to $O(\ensuremath{\beta}ln\ensuremath{\beta})$, which is a significant speedup especially for systems at low temperatures.
The Quantum Monte Carlo Diagonalization method for solving quantum many-body problems has been proposed, and its applications to the nuclear shell model have been extensively developed. This application is called Monte Carlo Shell Model. The actual numerical calculations of Monte Carlo Shell Model can be carried out very efficiently by a massive parallel computer, and indeed we have introduced one called Alphleet to RIKEN recently. A brief sketch of the Monte Carlo Shell Model and its parallel computing are presented.
As a new general-purpose Monte Carlo method, self-learning Monte Carlo (SLMC) has been numerically demonstrated in boson systems. In this work, we propose a new type of update algorithm, dubbed cumulative update, which could be naturally integrated into SLMC. Based on many local updates in the self-learned effective model, cumulative update efficiently proposes a global move with a high acceptance probability in the original model. Cumulative update can reduce the conventional computational cost of a full sweep O(N4) to O(N3), and also effectively reduce the auto-correlation time to be 1. We numerically show its efficiency through the well-known double-exchange model. With cumulative update, the SLMC could be several hundreds of times faster than the conventional local update method. By employing the cumulative update, SLMC can be generally used in any sign-problem-free Fermion systems and maximize the performance of Monte Carlo simulation.