arXiv:1906.02309 · Science Advances

Easing the Monte Carlo sign problem

Dominik Hangleiter, Ingo Roth, Daniel Nagaj, Jens Eisert

Published Aug 14, 2020• 86 citations

Abstract

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.

DOI: 10.1126/sciadv.abb8341

Related papers

Sign Problem in Quantum Monte Carlo Simulation

Gaopei Pan, Zi Yang Meng

Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation techniques, ranging from the world-line and stochastic series expansion Monte Carlo for boson and spin systems to the determinant and momentum-space quantum Monte Carlo for interacting fermions. We point out the basis dependency of the sign problem and summarize the progresses to cure, ease and even make use of the sign problem over the years, such as symmetry analysis of the underlying Hamiltonian, basis optimization in writting down the partition functions and many others. Moreover, we state that although traditional lore saying that in case of sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space, there are recent breakthroughs showing this is not always the case and based on the properties of the partition function for finite size systems, one could distinguish when the average sign has the usual exponential scaling and when it is bestowed with an algebraic scaling at the low temperature limit. Fermionic QMC simulations with such algebraic sign problems have been successfully carried out for extended Hubbard-type and quantum Moiré lattice models.

arXiv:2204.08777Apr 19, 20227 citations

Mitigating the sign problem by quantum computing

Kwai-Kong Ng, Min-Fong Yang

The notorious sign problem severely limits the applicability of quantum Monte Carlo (QMC) simulations, as statistical errors grow exponentially with system size and inverse temperature. A recent proposal of a quantum-computing stochastic series expansion (qc-SSE) method suggested that the problem could be avoided by introducing constant energy shifts into the Hamiltonian. Here we critically examine this framework and show that it does not strictly resolve the sign problem for Hamiltonians with non-commuting terms. Instead, it provides a practical mitigation strategy that suppresses the occurrence of negative weights. Using the antiferromagnetic anisotropic XY chain as a test case, we analyze the dependence of the average sign on system size, temperature, anisotropy, and shift parameters. An operator contraction method is introduced to improve efficiency. Our results demonstrate that moderate shifts optimally balance sign mitigation and statistical accuracy, while large shifts amplify errors, leaving the sign problem unresolved but alleviated.

arXiv:2509.13017Physical Review AFeb 25, 20260 citations

On the computational complexity of curing non-stoquastic Hamiltonians

Milad Marvian, Daniel A. Lidar, Itay Hen

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.

arXiv:1802.03408Nature CommunicationsApr 5, 201958 citations

Determining quantum Monte Carlo simulability with geometric phases

Itay Hen

Although stoquastic Hamiltonians are known to be simulable via sign-problem-free quantum Monte Carlo (QMC) techniques, the nonstoquasticity of a Hamiltonian does not necessarily imply the existence of a QMC sign problem.We give a sufficient and necessary condition for the QMC-simulability of Hamiltonians in a given basis: We prove that a QMC simulation will be sign-problem-free if and only if all the overall total phases along the chordless cycles of the weighted graph whose adjacency matrix is the Hamiltonian are zero (modulo 2π ).We use our findings to provide a construction for nonstoquastic, yet sign-problem-free and hence QMC-simulable, quantum many-body models.We also demonstrate why the simulation of truly sign-problematic models using the QMC weights of the stoquasticized Hamiltonian is generally suboptimal.We offer a superior alternative.

arXiv:2012.02022Physical Review ResearchApr 29, 202120 citations

Local Basis Transformation to Mitigate Negative Sign Problems

Murota, Keisuke, Synge Todo

Quantum Monte Carlo (QMC) methods for the frustrated quantum spin systems occasionally suffer from the negative sign problem, which makes simulations exponentially harder for larger systems at lower temperatures and severely limits QMC's application across a wide range of spin systems. This problem is known to depend on the choice of representation basis. We propose a systematic approach for mitigating the sign problem independent of the given Hamiltonian or lattice structure. We first introduce the concept of negativity to characterize the severity of the negative sign problem. We then demonstrate the existence of a locally defined quantity, the L1 adaptive loss function, which effectively approximates negativity, especially in frustration-free systems. Using the proposed loss function, we demonstrate that optimizing the representation basis can mitigate the negative sign. This is evidenced by several frustration-free models and other important quantum spin systems. Furthermore, we compare the effectiveness of unitary transformations against the standard orthogonal transformation and reveal that unitary transformations can effectively mitigate the sign problem in certain cases.

arXiv:2501.18069Jan 30, 20250 citations

Stoquasticity is not enough: towards a sharper diagnostic for Quantum Monte Carlo simulability

Arman Babakhani, Karakashian, Armen

Quantum Monte Carlo (QMC) methods are powerful tools for simulating quantum many-body systems, yet their applicability is limited by the infamous sign problem. We approach this challenge through the lens of Vanishing Geometric Phases (VGP) \cite{Hen_2021}, introducing it as a `geometric' criterion for diagnosing QMC simulability. We characterize the class of VGP Hamiltonians, and analyze the complexity of recognizing this class, identifying both hard and efficiently identifiable cases. We further highlight the practical advantage of the VGP criterion by exhibiting specific Hamiltonians that are readily identified as sign-problem-free through VGP, yet whose stoquasticity is difficult to ascertain. These examples underscore the efficiency and sharpness of VGP as a diagnostic tool compared to stoquasticity-based heuristics. Beyond classification, we propose a family of VGP-inspired diagnostics that serve as quantitative indicators of sign problem severity. While exact evaluation of these quantities is generically intractable, we demonstrate their mathematical power in performing scaling analysis for the average sign under unitary transformations. Our results provide both a conceptual foundation and practical tools for understanding and mitigating the sign problem.

arXiv:2508.14382Aug 20, 20250 citations