QAOA Mixing Hamiltonians for MinVertexCover

The minimum vertex cover problem (MinVertexCover) is an important optimization problem in graph theory, with applications in numerous fields outside of mathematics. As MinVertexCover is an NP-hard problem, there currently exists no efficient algorithm to find an optimal solution on arbitrary graphs. We consider quantum optimization algorithms,...

Designing a Quantum Algorithm for Real-Valued Addition Using Posit Arithmetic

Currently there are no efficient quantum algorithms for the addition of real-valued numbers. In classical computers addition is performed by using barrel shifters, a concept proven to be very inefficient as a quantum circuit due to its many garbage outputs when the barrel shifter is made reversible. This thesis aims to design a quantum algorithm...