Dynamic Variable Selection for subQUBO Annealing Using Hamming Weight

View at publisher Summarise with VIRAT
Authors: Yoshihito Saito, Koki Mita, Nozomu Togawa
Cited by: 0
References: 4

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Although Ising machines can efficiently solve combinatorial optimization problems, their direct application to largescale instances is infeasible due to an upper limit on the number of input variables. An effective approach to overcome this limitation is to partition the problem into smaller subproblems, known as subQUBOs. In this paper, we propose a dynamic variable selection method for subQUBOs that considers the Hamming weight of current solutions. Our proposed method constructs a subQUBO by dynamically selecting variables that are assigned a value of ‘1’—that is, focusing on the Hamming weight—in the current solution during the annealing process. This approach is expected to facilitate more substantial energy updates during iterations, thereby increasing the probability of finding optimal or near-optimal solutions. Finally, we demonstrate the effectiveness of our proposed method through experimental evaluations.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Metaheuristic Optimization Algorithms Research Constraint Satisfaction and Optimization

Publication details

Journal / source
International Conference on Consumer Electronics
Pages
1–4
Publication date
3 February 2026
Language
EN