Quantum many-body problems are exponentially hard to tackle with classical computers. Since decades, very sophisticated codes have been developed to tame this exponential wall. Among them, quantum Monte-Carlo codes stand out as very powerful tools that have been used to gain insights into the physics of strongly-correlated systems such as condensed-matter problems or quantum chemical problems. Despite their sophistication, these codes often run into numerical hurdles often called the Monte-Carlo sign problem. Recently, hybrid quantum approaches have suggested that quantum processors could help alleviate this sign problem. In this internship, you will explore some of these approaches using the Qaptiva framework and test their robustness to realistic conditions. Reference: http://arxiv.org/abs/2308.07964