Mitigating the Sign Problem Through Basis Rotations

Abstract

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 $\beta$ and system size. The sign problem is basis dependent and an improved basis, for fixed errors, lead 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\times 4$ systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the $16\times 4$ Hubbard model at $U/t=4$ and $n=0.75$ increases by $\exp \left[8.64(6)\beta \right]$. For typical projection times of $\beta ⪆100$, this accelerates such simulation by many orders of magnitude.

References in corpus (11)

• The density-matrix renormalization group in the age of matrix product states
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Isometric Tensor Network States in Two Dimensions
• Easing the Monte Carlo sign problem
• Thermodynamic properties of the Shastry-Sutherland model from quantum Monte Carlo simulations
• Variational ground states of 2D antiferromagnets in the valence bond basis
• Conversion of projected entangled pair states into a canonical form
• The effect of quantization on the FCIQMC sign problem
• Wavefunction positivization via automatic differentiation
• Variational optimization in the AI era: Computational Graph States and Supervised Wave-function Optimization
• Complementary First and Second Derivative Methods for Ansatz Optimization in Variational Monte Carlo

Cited by in corpus (18)

• Easing the Monte Carlo sign problem
• Symmetry-protected sign problem and magic in quantum phases of matter
• Fast and scalable quantum Monte Carlo simulations of electron-phonon models
• A perspective on machine learning and data science for strongly correlated electron problems
• Universality and Critical Exponents of the Fermion Sign Problem
• Fermion sign bounds theory in quantum Monte Carlo simulation
• Automatic Differentiable Monte Carlo: Theory and Application
• Sign Problem in Quantum Monte Carlo Simulation
• An Amelioration for the Sign Problem: Adiabatic Quantum Monte Carlo
• Mitigating the fermion sign problem by automatic differentiation
• Imaginary-time Mpemba effect in quantum many-body systems
• Defining a universal sign to strictly probe a phase transition
• Boosting quantum Monte Carlo and alleviating sign problem by Gutzwiller projection
• Quantum computing quantum Monte Carlo algorithm
• Preempting Fermion Sign Problem: Unveiling Quantum Criticality through Nonequilibrium Dynamics in Imaginary Time
• Sampling and the complexity of nature
• Real-space spectral simulation of quantum spin models: Application to generalized Kitaev models
• Linear Foundation Model for Quantum Embedding: Data-Driven Compression of the Ghost Gutzwiller Variational Space