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

Computer Physics Communications

Application of new Monte Carlo algorithms to random spin systems

Yutaka Okabe, Yusuke Tomita, Chiaki Yamaguchi

Published Jun 1, 2002• 28 citations
Publisher
DOI
10.1016/s0010-4655(02)00435-6

Related papers

Monte Carlo studies on quantum and random spin systems

Yutaka Okabe, Ishizuka Jun-ichi, 岡部 豊 +1 more

•Jan 1, 1995•0 citations

Scrambled quasirandom sequences and their applications

Hongmei Chi, Michael Mascagni

Quasi-Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo's pseudorandom numbers. Monte Carlo methods offer statistical error estimates; however, while quasi-Monte Carlo has a faster convergence rate than normal Monte Carlo, one cannot obtain error estimates from quasi-Monte Carlo sample values by any practical way. A recently proposed method, called randomized quasi-Monte Carlo methods, takes advantage of Monte Carlo and quasi-Monte Carlo methods. Randomness can be brought to bear on quasirandom sequences through scrambling and other related randomization techniques in randomized quasi-Monte Carlo methods, which provide an elegant approach to obtain error estimates for quasi-Monte Carlo based on treating each scrambled sequence as a different and independent random sample. The core of randomized quasi-Monte Carlo is to find an effective and fast algorithm to scramble (randomize) quasirandom sequences. This dissertation surveys research on algorithms and implementations of scrambled quasirandom sequences and proposes some new algorithms to improve the quality of scrambled quasirandom sequences. Besides obtaining error estimates for quasi-Monte Carlo, scrambling techniques provide a natural way to parallelize quasirandom sequences. This scheme is especially suitable for distributed or grid computing. By scrambling a quasirandom sequence we can produce a family of related quasirandom sequences. Finding one or a subset of optimal quasirandom sequences within this family is an interesting problem, as such optimal quasirandom sequences can be quite useful for quasi-Monte Carlo. The process of finding such optimal quasirandom sequences is called the derandomization of a randomized (scrambled) family. We summarize aspects of this technique and propose some new algorithms for finding optimal sequences from the Halton, Faure and Sobol sequences. Finally we explore applications of derandomization.

•Jan 1, 2004•8 citations

Monte Carlo simulation of model spin systems

S. Ramasesha

Proceedings of the Indian Academy of Sciences Section C Engineering Sciences•Mar 1, 1979•1 citation

Quantum Monte Carlo study of two-dimensional random Heisenberg antiferromagnets

Synge Todo, 眞治 藤堂

Recent improvement of Monte Carlo techniques for quantum magnets, together with contin-ual development of high-performance parallel computers, makes us possible to access precise information about novel and peculiar features of low-dimensional random quantum antiferro-magnets, observed at extremely low energy scale. We give a review on the powerful continuous-time loop algorithm for the world-line quantum Monte Carlo method, and its application to the random quantum Heisenberg antiferromagnts, especially effects of non-magnetic impurities and also of bond randomness on the spin-gapped ground state of the two-dimensional systems. 1

•Jun 14, 2001•0 citations

Monte Carlo Simulations of Spin Systems

Wolfhard Janke E

Springer eBooks•Jan 1, 1996•40 citations

Inchworm Monte Carlo Method for Open Quantum Systems

Zhenning Cai, Jianfeng Lu, Siyao Yang

Abstract We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method—the inchworm Monte Carlo method—for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover, we introduce an integro‐differential equation formulation for open quantum systems, which illuminates the mathematical structure of the inchworm algorithm. This new formulation leads to an improvement of the inchworm algorithm by introducing classical deterministic time‐integration schemes. The numerical method is validated by applications to the spin‐boson model. © 2020 Wiley Periodicals, Inc.

arXiv:1811.08044•Communications on Pure and Applied Mathematics•Mar 6, 2020•33 citations
Quasi-Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo's pseudorandom numbers. Monte Carlo methods offer statistical error estimates; however, while quasi-Monte Carlo has a faster convergence rate than normal Monte Carlo, one cannot obtain error estimates from quasi-Monte Carlo sample values by any practical way. A recently proposed method, called randomized quasi-Monte Carlo methods, takes advantage of Monte Carlo and quasi-Monte Carlo methods. Randomness can be brought to bear on quasirandom sequences through scrambling and other related randomization techniques in randomized quasi-Monte Carlo methods, which provide an elegant approach to obtain error estimates for quasi-Monte Carlo based on treating each scrambled sequence as a different and independent random sample. The core of randomized quasi-Monte Carlo is to find an effective and fast algorithm to scramble (randomize) quasirandom sequences. This dissertation surveys research on algorithms and implementations of scrambled quasirandom sequences and proposes some new algorithms to improve the quality of scrambled quasirandom sequences. Besides obtaining error estimates for quasi-Monte Carlo, scrambling techniques provide a natural way to parallelize quasirandom sequences. This scheme is especially suitable for distributed or grid computing. By scrambling a quasirandom sequence we can produce a family of related quasirandom sequences. Finding one or a subset of optimal quasirandom sequences within this family is an interesting problem, as such optimal quasirandom sequences can be quite useful for quasi-Monte Carlo. The process of finding such optimal quasirandom sequences is called the derandomization of a randomized (scrambled) family. We summarize aspects of this technique and propose some new algorithms for finding optimal sequences from the Halton, Faure and Sobol sequences. Finally we explore applications of derandomization.
Recent improvement of Monte Carlo techniques for quantum magnets, together with contin-ual development of high-performance parallel computers, makes us possible to access precise information about novel and peculiar features of low-dimensional random quantum antiferro-magnets, observed at extremely low energy scale. We give a review on the powerful continuous-time loop algorithm for the world-line quantum Monte Carlo method, and its application to the random quantum Heisenberg antiferromagnts, especially effects of non-magnetic impurities and also of bond randomness on the spin-gapped ground state of the two-dimensional systems. 1
Abstract We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method—the inchworm Monte Carlo method—for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover, we introduce an integro‐differential equation formulation for open quantum systems, which illuminates the mathematical structure of the inchworm algorithm. This new formulation leads to an improvement of the inchworm algorithm by introducing classical deterministic time‐integration schemes. The numerical method is validated by applications to the spin‐boson model. © 2020 Wiley Periodicals, Inc.