Finding Maximum Cliques on the D-Wave Quantum Annealer

@article{Chapuis2019FindingMC,
  title={Finding Maximum Cliques on the D-Wave Quantum Annealer},
  author={Guillaume Chapuis and Hristo N. Djidjev and Georg Hahn and Guillaume Rizk},
  journal={Journal of Signal Processing Systems},
  year={2019},
  volume={91},
  pages={363-377}
}
  • Guillaume Chapuis, Hristo N. Djidjev, +1 author Guillaume Rizk
  • Published in J. Signal Process. Syst. 2019
  • Computer Science, Physics, Mathematics
  • Highlight Information
    This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. [...] Key Method For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, and compare several quantum implementations to current classical algorithms…Expand Abstract

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    3
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 14 CITATIONS

    Solving Large Maximum Clique Problems on a Quantum Annealer

    VIEW 18 EXCERPTS
    CITES METHODS & BACKGROUND

    A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound

    VIEW 10 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Finding Maximum Cliques on the D-Wave Quantum Annealer

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Finding the chromatic sums of graphs using a D-Wave quantum computer

    VIEW 1 EXCERPT
    CITES METHODS

    Optimizing the Spin Reversal Transform on the D-Wave 2000Q

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Peering Into the Anneal Process of a Quantum Annealer

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES

    Fast clique minor generation in Chimera qubit connectivity graphs

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Finding Maximum Cliques on the D-Wave Quantum Annealer

    VIEW 1 EXCERPT

    Solving sparse representations for object classification using the quantum d-wave 2x machine

    • N. Nguyen, G. Kenyon
    • Los Alamos ISTI debrief,
    • 2017
    VIEW 1 EXCERPT

    Traffic Flow Optimization Using a Quantum Annealer

    VIEW 1 EXCERPT

    Graph Partitioning using the D-Wave for Electronic Structure Problems

    • S. Mniszewski, C. Negre, H. Ushijima-Mwesigwa
    • 2016
    VIEW 1 EXCERPT