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,...

Learning based hardware-centric quantum circuit generation

Large fault­tolerant universal gate quantum computers will provide a major speed­up to a variety of common computational problems. While such computers are years away, we currently have noisy intermediate­scale quantum (NISQ) computers at our disposal. In this project we present two quantum machine learning approaches that can be used to find...