Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“HQA (Leap Hybrid solver), developed by D-Wave systems, also decomposes large QUBO into smaller subproblems wellsuited for QA ' s QPU, and then aggregates the results 27,44 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [27]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In addition, a QUBO decomposition algorithm (i.e., QBSolv) splits a large QUBO matrix into small pieces of subQUBO matrices, allowing us to handle a QUBO matrix with dimensions higher than the maximum number of qubits in the QA hardware 26,27 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [27]
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
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821 · cited 2×
“A method based on the impact values was proposed in [10], while a method based on k-opt local search [12], [13] was proposed in [9].”
MethodIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512 · cited 1×
“(1) [1], [14], [15].”
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×
“Isingmachinesinclude,forexample,D-Wave Systems’quantumannealingmachines[4],[16],[17],Hitachi’s CMOSannealingmachines[18],[19],andFujitsu’sdigital annealers[5],[6].”
A Method for Solving Traveling-Salesman Problems
Croes, G. A. (1958) · Operations Research · doi:10.1287/opre.6.6.791 · Cited by 1,570
Traffic Flow Optimization Using a Quantum Annealer
Neukart, F., Compostella, G., Seidel, C., von Dollen, D., Yarkoni, S., & Parney, B. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00029 · Cited by 458 · cited 2×
“, route optimization for transportation or logistics and optimal control of robot behavior) [1], [2], [3].”
BackgroundPhysics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442 · cited 3×
“To tackle this problem, Ising machines have recently been focused on as a new computer architecture [4], [5], [6].”
MethodMinor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410 · cited 2×
“AlthoughtheD-Wave2000Qmachine[4]hasapproxi-mately 2000 qubits, it can only deal with a maximum of 64 binary variables of a QUBO model if all the binary variables are connected to each other due to hardware limitations [7], [8].”
BackgroundCombinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Goto, H., Tatsumura, K., & Dixon, A. R. (2019) · Science Advances · doi:10.1126/sciadv.aav2372 · Cited by 405 · cited 1×
“Isingmachines based on computational principles different from quantum annealing and simulated annealing includeNTT’s coherent Isingmachines [20] and Toshiba’s simulatedbifurcationmachines [21].”
BackgroundQAPLIB-A quadratic assignment problem library
Burkard, R. E., Karisch, S., & Rendl, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90197-4 · Cited by 332
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Bunyk, P. I., Hoskinson, E. M., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., et al. (2014) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2014.2318294 · Cited by 312 · cited 1×
“Isingmachinesinclude,forexample,D-Wave Systems’quantumannealingmachines[4],[16],[17],Hitachi’s CMOSannealingmachines[18],[19],andFujitsu’sdigital annealers[5],[6].”
Research works printed but not linked: 2
- Booth, 2017, Partitioning optimization problems for hybrid classical/quantum execution technical report, D-Wave Tech. Rep.
- Inagaki, 2016, A coherent Ising machine for 2000-node optimization problems, 354, 603
Cited by
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“In addition, a QUBO decomposition algorithm(i.e.,QBSolv)splitsalargeQUBOmatrixintosmallpiecesofsub-QUBOmatrices,allowingustohandleaQUBOmatrixwithdimensions higherthanthemaximumnumberofqubitsintheQAhardware 26,27 .”
Kim, S., Pascuzzi, V. R., Xu, Z., Luo, T., Lee, E., & Suh, I. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01283-2 · Cited by 31
“This QUBO decomposition can fi nd a true global optimal solution of an original large QUBO when preserving essential structure and interactions of the original problem 51,52 .”
Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs
Nakano, K., Takafuji, D., Ito, Y., Yazane, T., Yano, J., Ozaki, S., Katsuki, R., & Mori, R. (2023) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw59300.2023.00060 · Cited by 21
“QAP problems tai20a and tho30 have been used for evaluating a QUBO solver using the subQUBO model [40].”
MethodQuantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Nano Convergence · doi:10.1186/s40580-024-00425-6 · Cited by 20
An Ising-Machine-Based Solver of Vehicle Routing Problem With Balanced Pick-Up
Bao, S., Tawada, M., Tanaka, S., & Togawa, N. (2023) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2023.3335392 · Cited by 21
Self-citation
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
- hybrid
- doi.org
- Licence
- 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.