A short-loop algorithm for quantum Monte Carlo simulations
Ying-Jer Kao, Roger G. Melko

TL;DR
This paper introduces a short-loop quantum Monte Carlo algorithm that improves simulation efficiency by constructing smaller non-local clusters, especially in challenging parameter regimes.
Contribution
It presents a novel short-loop algorithm variant that enhances efficiency over traditional methods in quantum Monte Carlo simulations.
Findings
Significant efficiency increase observed in certain regimes
Algorithm works well on square lattice spin-1/2 XXZ model
Provides a prototype for complex quantum systems
Abstract
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short-loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short-loops on more complicated quantum systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
