CoChat

Systematic and deterministic graph minor embedding for Cartesian products of graphs

Open access
Zaribafiyan, Arman, Marchand, Dominic J. J., Changiz Rezaei, Seyed Saeed · 2017 · Quantum Information Processing
Cited by 40

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

Abstract

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph minor embedding methods. These methods allow non-native problems to be adapted to the target annealer’s architecture. The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for solving real-world applications. To alleviate this difficulty, we propose a systematic and deterministic embedding method, exploiting the structures of both the specific problem and the quantum annealer. We focus on the specific case of the Cartesian product of two complete graphs, a regular structure that occurs in many problems. We decompose the embedding problem by first embedding one of the factors of the Cartesian product in a repeatable pattern. The resulting simplified problem comprises the placement and connecting together of these copies to reach a valid solution. Aside from the obvious advantage of a systematic and deterministic approach with respect to speed and efficiency, the embeddings produced are easily scaled for larger processors and show desirable properties for the number of qubits used and the chain length distribution. We conclude by briefly addressing the problem of circumventing inoperable qubits by presenting possible extensions of our method.

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/s11128-017-1569-z

Cites

3 of 3 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

  • Quantum annealing with manufactured spins

    Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 1×

    “One type of quadratic solver which has garnered considerable attention in the past few years is the quantum annealing processor manufactured by D-Wave Systems [9, 10].”
    Background
  • Quantum Optimization of Fully Connected Spin Glasses

    Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209 · cited 1×

    “It was also suggested that having heterogeneous chain lengths in an embedding is disadvantageous since the chains tend to exhibit unpredictable chain dynamics throughout the annealing process [3, 19].”
    Background
  • Adiabatic quantum programming: minor embedding with hard faults

    Klymko, C., Sullivan, B. D., & Humble, T. S. (2014) · Quantum Information Processing · doi:10.1007/s11128-013-0683-9 · Cited by 99 · cited 1×

    “On the other hand, the tree-width of the square Chimera graph CN,N,L is equal to NL (see [12]) and the tree-width of Kn Kn is equal to (n(2) + n)/2 − 1 (see [13] and [14]).”
    Background

Show all 3 references

Cited by

See all 40

Metadata

Authors
Zaribafiyan, A., Marchand, D. J. J., & Changiz Rezaei, S. S.
Venue
Quantum Information Processing
Published
2017-04-10
Volume
16
Issue
5
ISSN
  • 1570-0755 (ISSN-L)
  • 1573-1332
OpenAlex
W2407418246
Cited by
40
References
3
FWCI
3.94
Type
journal article
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: Systematic and deterministic graph minor embedding for Cartesian products of graphs. https://app.cochat.ai/papers/10.1007/s11128-017-1569-z
The paper
Zaribafiyan, A., Marchand, D. J. J., & Changiz Rezaei, S. S. (2017). Systematic and deterministic graph minor embedding for Cartesian products of graphs. Quantum Information Processing. https://doi.org/10.1007/s11128-017-1569-z

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.