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

arXiv:hep-lat/9509043 · Nuclear Physics B - Proceedings Supplements

Tuning the generalized Hybrid Monte Carlo algorithm

Anthony D. Kennedy, Robert G. Edwards, H. Mino, Brian J. Pendleton

Published Mar 1, 1996• 8 citations
arXivHTMLPDF
DOI
10.1016/0920-5632(96)00173-9

Related papers

Critical dynamics of the hybrid Monte Carlo algorithm

B. Mehlig, António Luis Ferreira, Dieter W. Heermann

Physics Letters B•Sep 1, 1992•7 citations

Dynamical critical properties of the Hybrid Monte Carlo algorithm

Sourendu Gupta A

Nuclear Physics B•Feb 1, 1992•15 citations

Hybrid Monte Carlo algorithm for the double exchange model

Alonso, J. L., Fernández Pérez, Luis Antonio, F. Guinea +2 more

•Mar 5, 2001•76 citations

Hybrid Monte Carlo algorithm for the double exchange model

J.L. Alonso, L.A. Fernández, F. Guinea +2 more

arXiv:cond-mat/0007450•Nuclear Physics B•Mar 1, 2001•109 citations

Hybrid algorithms in quantum Monte Carlo.

Luke Shulenburger

•Aug 12, 2016•3 citations

Study of a generalized Metropolis decision rule in auxiliary field quantum Monte Carlo

Martin, C. L., Richard M. Fye

We consider a generalization of the standard Metropolis algorithm acceptance/rejection decision rule and numerically explore its properties using auxiliary field quantum Monte Carlo. The generalization involves a free parameter which, given a criterion for proposing attempted moves, can be used to tune the average acceptance rate in a particular way. Such tuning can also potentially change Monte Carlo autocorrelation times, and the combination of the changing acceptance rate and autocorrelation times raises the possibility of more efficient simulations. We explore these issues using primarily massively parallel quantum Monte Carlo runs of the ``test case'' two-dimensional Hubbard model, and discuss results and applications.

arXiv:cond-mat/9901055•Jan 7, 1999•0 citations
We consider a generalization of the standard Metropolis algorithm acceptance/rejection decision rule and numerically explore its properties using auxiliary field quantum Monte Carlo. The generalization involves a free parameter which, given a criterion for proposing attempted moves, can be used to tune the average acceptance rate in a particular way. Such tuning can also potentially change Monte Carlo autocorrelation times, and the combination of the changing acceptance rate and autocorrelation times raises the possibility of more efficient simulations. We explore these issues using primarily massively parallel quantum Monte Carlo runs of the ``test case'' two-dimensional Hubbard model, and discuss results and applications.