Overcoming the quantum sign problem

The infamous so-called 'sign problem' is responsible for the computational intractability of predicting features of many quantum systems via Monte Carlo algorithms on the one hand, and facilitates the power of quantum computing devices on the other hand. In my talk, I will present various perspectives and results on the quantum sign problem, with the goal to overcome the limitations it poses to predicting properties of physical systems. In particular, I will discuss the possibility of systematically mitigating the sign problem of Monte Carlo algorithms. I close with an outlook onto using precisely controlled quantum simulators to predict properties of quantum materials and discuss some challenges we face when improving their accuracy.