Performance of the Extended Ising Machine for the Quadratic Knapsack Problem
Statistical Mechanics
2025-08-12 v1 Data Structures and Algorithms
Abstract
The extended Ising machine (EIM) enhances conventional Ising models, which handle only binary quadratic forms by allowing constraints through real-valued dependent variables. We address the quadratic knapsack problem (QKP), hard to solve using Ising machines when formulated as a quadratic unconstrained binary optimization (QUBO). We demonstrated the EIM's superiority by comparing it with the conventional Ising model-based approach, a commercial exact solver, and a state-of-the-art heuristic solver for QKP.
Keywords
Cite
@article{arxiv.2508.06909,
title = {Performance of the Extended Ising Machine for the Quadratic Knapsack Problem},
author = {Haruka Akishima and Hirotaka Tamura and Kazue Kudo},
journal= {arXiv preprint arXiv:2508.06909},
year = {2025}
}
Comments
6 pages