Mitigating sign problem by automatic differentiation

As an intrinsically-unbiased method, quantum Monte Carlo (QMC) is of unique importance in simulating interacting quantum systems. Unfortunately, QMC often suffers from the notorious sign problem. Although generically curing sign problem is shown to be hard (NP-hard), sign problem of a given quantum model may be mitigated (sometimes even cured) by finding better choices of simulation scheme. A universal framework in identifying optimal QMC schemes has been desired. Here, we propose a general framework using automatic differentiation (AD) to automatically search for the best continuously-parameterized QMC scheme, which we call “automatic differentiable sign mitigation” (ADSM). As a showcase, we apply the ADSM framework to the honeycomb lattice Hubbard model with Rashba spin-orbit coupling and demonstrate ADSM’s effectiveness in mitigating its sign problem. For the model under study, ADSM leads a significant power-law acceleration in computation time (the computation time is reduced from M to the order of M^ν with ν ≈ 2/3).