CoChat

Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances

Open access
Atobe, Yuta, Tawada, Masashi, Togawa, Nozomu · 2022 · IEEE Transactions on Computers

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

Abstract

Ising machines are expected to solve combinatorial optimization problems efficiently by representing them as Ising models or equivalent quadratic unconstrained binary optimization (QUBO) models . However, upper bound exists on the computable problem size due to the hardware limitations of Ising machines. This paper propose a new hybrid annealing method based on partial QUBO extraction, called subQUBO model extraction, with multiple solution instances. For a given QUBO model, the proposed method obtains$N_I$quasi-optimal solutions (quasi-ground-state solutions) in some way using a classical computer. The solutions giving these quasi-optimal solutions are calledsolution instances. We extract a size-limited subQUBO model as follows based on a strong theoretical background: we randomly select$N_S$$(N_S

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.1109/tc.2021.3138629

Cites

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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 35 references

Research works printed but not linked: 2

  1. Booth, 2017, Partitioning optimization problems for hybrid classical/quantum execution technical report, D-Wave Tech. Rep.
  2. Inagaki, 2016, A coherent Ising machine for 2000-node optimization problems, 354, 603

Cited by

See all 41

Metadata

Authors
Atobe, Y., Tawada, M., & Togawa, N.
Affiliations
Waseda University (JP)
Venue
IEEE Transactions on Computers
Published
2022-10-01
Volume
71
Issue
10
Pages
2606-2619
ISSN
  • 0018-9340 (ISSN-L)
  • 1557-9956
  • 2326-3814
OpenAlex
W4206549951
Cited by
38
References
32
Citations by year
2026: 5 · 2025: 19 · 2024: 8 · 2023: 6
FWCI
1.24
Type
journal article
Language
en
Open access
Locations
IEEE Transactions on Computers (publishedVersion, cc-by-nc-nd)
Funders
New Energy and Industrial Technology Development Organization (P16007)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
Ising machines, combinatorial optimization, quasi-optimal solutions, classical optimization, quantum annealing

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: Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances. https://app.cochat.ai/papers/10.1109/tc.2021.3138629
The paper
Atobe, Y., Tawada, M., & Togawa, N. (2022). Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2021.3138629

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.