• lattice qcd
• numerical simulations
• quantum computing

The main purpose of this work is to study quantum algorithms that can overcome the sign problem. Many theories, like QCD at finite baryon density, present this problem that makes classical Monte Carlo sampling techniques fail.
In particular we study a hybrid quantum algorithm, the so-called Quantum-Quantum Metropolis Algorithm (QQMA), by implementing it on a quantum simulator and by testing it on toy models, that present the sign problem. Then a comparison with the Quantum Metropolis Sampling (QMS) algorithm is done, in order to see which one will be more efficient on a future real quantum computer.