Solving large minimum vertex cover problems on a quantum annealer
Proceedings of the 16th ACM International Conference on Computing Frontiers, pp. 76-84, 2019.
We consider the minimum vertex cover problem having applications in e.g. biochemistry and network security. Quantum annealers can find the optimum solution of such NP-hard problems, given they can be embedded on the hardware. This is often infeasible due to limitations of the hardware connectivity structure. This paper presents a decompos...More
PPT (Upload PPT)