Suppression of the negative sign problem in quantum Monte Carlo

TL;DR

This paper introduces a novel quantum Monte Carlo algorithm that effectively suppresses the negative sign problem in quantum spin system simulations, with linear complexity and proven correctness, demonstrated on a 2D fermionic model.

Contribution

A new Monte Carlo algorithm that suppresses the sign problem with linear complexity and rigorous correctness proof.

Findings

Eliminates the sign problem in tested models

Has linear complexity in lattice size

Proven to be correct through rigorous proof

Abstract

We present a new Monte Carlo algorithm for simulating quantum spin systems which is able to suppress the negative sign problem. This algorithm has only a linear complexity in the lattice size used for the simulation. A general description and a rigorous proof of its correctness is given. Its efficiency is tested on a simple 2-dimensional fermionic model. For this model we show that our algorithm eliminates the sign problem.