CoChat

Solving Large Maximum Clique Problems on a Quantum Annealer

Open access
Pelofske, Elijah, Hahn, Georg, Djidjev, Hristo · 2019 · Lecture Notes in Computer Science
Cited by 38

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Commercial quantum annealers from D-Wave Systems can find high quality solutions of quadratic unconstrained binary optimization problems that can be embedded onto its hardware. However, even though such devices currently offer up to 2048 qubits, due to limitations on the connectivity of those qubits, the size of problems that can typically be solved is rather small (around 65 variables). This limitation poses a problem for using D-Wave machines to solve application-relevant problems, which can have thousands of variables. For the important Maximum Clique problem, this article investigates methods for decomposing larger problem instances into smaller ones, which can subsequently be solved on D-Wave. During the decomposition, we aim to prune as many generated subproblems that don’t contribute to the solution as possible, in order to reduce the computational complexity. The reduction methods presented in this article include upper and lower bound heuristics in conjunction with graph decomposition, vertex and edge extraction, and persistency analysis.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-030-14082-3_11

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 38

Metadata

Authors
Pelofske, E., Hahn, G., & Djidjev, H.
Venue
Lecture Notes in Computer Science
Published
2019
Pages
123-135
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2914574155
Cited by
38
References
5
FWCI
2.10
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Solving Large Maximum Clique Problems on a Quantum Annealer. https://app.cochat.ai/papers/10.1007/978-3-030-14082-3_11
The paper
Pelofske, E., Hahn, G., & Djidjev, H. (2019). Solving Large Maximum Clique Problems on a Quantum Annealer. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-14082-3_11

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.