Sign-Problem-Free Monte Carlo Simulation of Certain Frustrated Quantum Magnets

Amelioration for the Sign Problem: An Adiabatic Quantum Monte Carlo Algorithm

We introduce the adiabatic quantum Monte Carlo (AQMC) method, where we gradually crank up the interaction strength, as an amelioration of the sign problem. It is motivated by the adiabatic theorem and will approach the true ground state if the evolution time is long enough. We demonstrate that the AQMC algorithm enhances the average sign exponentially such that low enough temperatures can be accessed and ground-state properties probed. It is a controlled approximation that satisfies the variational theorem and provides an upper bound for the ground-state energy. We first benchmark the AQMC algorithm vis-à-vis the undoped Hubbard model on the square lattice which is known to be sign-problem-free within the conventional quantum Monte Carlo formalism. Next, we test the AQMC algorithm against the density-matrix-renormalization-group approach for the doped four-leg ladder Hubbard model and demonstrate its remarkable accuracy. As a nontrivial example, we apply our method to the Hubbard model at p=1/8 doping for a 16×8 system and discuss its ground-state properties. We finally utilize our method and demonstrate the emergence of U(1)_{2}∼SU(2)_{1} topological order in a strongly correlated Chern insulator.

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. We show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the "badness" of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β⪆100, this accelerates such simulation by many orders of magnitude.

Magnon Crystallization in the Kagome Lattice Antiferromagnet

We present numerical evidence for the crystallization of magnons below the saturation field at nonzero temperatures for the highly frustrated spin-half kagome Heisenberg antiferromagnet. This phenomenon can be traced back to the existence of independent localized magnons or, equivalently, flatband multimagnon states. We present a loop-gas description of these localized magnons and a phase diagram of this transition, thus providing information for which magnetic fields and temperatures magnon crystallization can be observed experimentally. The emergence of a finite-temperature continuous transition to a magnon crystal is expected to be generic for spin models in dimension D>1 where flatband multimagnon ground states break translational symmetry.

Easing the Monte Carlo sign problem

Quantum Monte Carlo (QMC) methods are the gold standard for studying equilibrium properties of quantum many-body systems. However, in many interesting situations, QMC methods are faced with a sign problem, causing the severe limitation of an exponential increase in the runtime of the QMC algorithm. In this work, we develop a systematic, generally applicable, and practically feasible methodology for easing the sign problem by efficiently computable basis changes and use it to rigorously assess the sign problem. Our framework introduces measures of non-stoquasticity that-as we demonstrate analytically and numerically-at the same time provide a practically relevant and efficiently computable figure of merit for the severity of the sign problem. Complementing this pragmatic mindset, we prove that easing the sign problem in terms of those measures is generally an NP-complete task for nearest-neighbor Hamiltonians and simple basis choices by a reduction to the MAXCUT-problem.

On the computational complexity of curing non-stoquastic Hamiltonians

Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with 'curing' non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.

Resolution of the sign problem for a frustrated triplet of spins

We propose a mechanism for solving the "negative sign problem"-the inability to assign non-negative weights to quantum Monte Carlo configurations-for a toy model consisting of a frustrated triplet of spin-1/2 particles interacting antiferromagnetically. The introduced technique is based on the systematic grouping of the weights of the recently developed off-diagonal series expansion of the canonical partition function [Phys. Rev. E 96, 063309 (2017)PREHBM2470-004510.1103/PhysRevE.96.063309]. We show that, although the examined model is easily diagonalizable, the sign problem it encounters can nonetheless be very pronounced, and we offer a systematic mechanism to resolve it. We discuss the prospects of generalizing the suggested scheme and the steps required to extend it to more general and larger spin models.

Thermal Critical Points and Quantum Critical End Point in the Frustrated Bilayer Heisenberg Antiferromagnet

We consider the finite-temperature phase diagram of the S=1/2 frustrated Heisenberg bilayer. Although this two-dimensional system may show magnetic order only at zero temperature, we demonstrate the presence of a line of finite-temperature critical points related to the line of first-order transitions between the dimer-singlet and -triplet regimes. We show by high-precision quantum Monte Carlo simulations, which are sign-free in the fully frustrated limit, that this critical point is in the Ising universality class. At zero temperature, the continuous transition between the ordered bilayer and the dimer-singlet state terminates on the first-order line, giving a quantum critical end point, and we use tensor-network calculations to follow the first-order discontinuities in its vicinity.