Application of the quantum approximate optimization algorithm to combinatorial optimization problems

Sammanfattning: This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA). It is a hybrid quantum-classical algorithm for solving combinatorial optimization problems and is a promising algorithm to run on near term quantum devices. In this thesis, we will introduce the workings of the QAOA, together with some applications of it on combinatorial optimization problems.

  KLICKA HÄR FÖR ATT SE AVHANDLINGEN I FULLTEXT. (PDF-format)