The two-site Heisenberg model studied using a quantum computer: A didactic introduction

Abstract

The two-site Heisenberg model has an extraordinarily simple analytical solution and is traditionally used as a benchmark against numerical methods, such as exact diagonalization and Monte Carlo methods. In the same spirit, we benchmark three quantum algorithms that are implemented in a quantum computer against the analytical solution of this model. In particular, this presentation includes a description of the standard and iterative quantum phase estimation algorithms, as well as the variational quantum eigensolver. These quantum algorithms are introduced in a pedagogical fashion allowing newcomers to the subject, familiar with only the most basic quantum mechanical systems, to easily reproduce the presented results and apply the methods to other problems, thus building a seemingly under-appreciated path towards useful quantum algorithms through the lens of simulating and computing properties of physical quantum systems.

Keywords

• Heisenberg Model
• Quantum algorithms
• Phase estimation
• Variational quantum eigensolver