Solving large minimum vertex cover problems on a quantum annealer

    Elijah Pelofske
    Elijah Pelofske
    Georg Hahn
    Georg Hahn

    Proceedings of the 16th ACM International Conference on Computing Frontiers, pp. 76-84, 2019.

    Cited by: 5|Bibtex|Views10|Links
    EI

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments