Simulations and Analysis of Adiabatic Quantum Annealing

Abstract: This project aimed to investigate some properties of a quantum annealer by simulatingit on a classical computer. We chose the problem Hamiltonian on the form of theIsing model with interaction energies between all qubits.The results of our investigation showed at what part of the quantum annealing theminimum energy gap typically occurs for randomly generated Hamiltonians. We sawhow the quantum annealing process should proceed in order to achieve a higher probabilityof obtaining the correct answer. Additionally, we noted that the annealing timeincreases with qubit count. Interesting phenomenon as “self-rescue” and wave-like convergencearose during the investigation. We also presented an algorithm for solving thegame Minesweeper in this paper.The results in this project can be used to find potential properties of larger systemsand also as a base for possible future extensions.