Papers › A quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians

A quantum Monte Carlo algorithm for arbitrary spin-1/2 Hamiltonians

13 Jul 2023arXiv:2307.06503links table onlyarchive 2025-07-28

Lev Barash, Arman Babakhani, Itay Hen

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-1/2 Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and simple automated protocol that produces QMC updates that are provably ergodic and satisfy detailed balance. We demonstrate the applicability and versatility of our method by considering several illustrative examples, including the simulation of the XY model on a triangular lattice, the toric code, and random k-local Hamiltonians. We have made our program code freely accessible on GitHub.

PaperPDFCode

Code

levbarash/pmrqmc officialmentioned in paper report
naezzell/PMRQMC_fidsus mentioned on GitHub report
naezzell/advmeaPMRQMC mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections