Curator's Take
AI Commentary
This article is noteworthy because JIJ’s SQOA Solver shows a practical route to bypass the current qubit‑count bottleneck by compressing problem variables and offloading much of the heavy lifting to classical subspace diagonalization, something few quantum‑software offerings provide today. By demonstrating 384‑node MaxCut and 200‑node MIS on IBM hardware, it builds on recent hybrid approaches such as QAOA‑enhanced classical preprocessing and signals that large‑scale combinatorial optimization may become feasible before fault‑tolerant machines arrive. The result is a more accessible toolkit for enterprises seeking quantum advantage on near‑term devices, though the performance still hinges on the quality of the encoding and the underlying hardware noise levels.
— Mark Eatherly
Summary
JIJ Inc. has launched its SQOA Solver in the IBM Quantum Functions Catalog, allowing users to tackle complex optimization problems with more variables than available qubits. This solver utilizes a novel approach that combines variable-compression encoding and classical subspace diagonalization, eliminating the need for iterative quantum hardware optimization. It has demonstrated success in solving large-scale problems like 384-node MaxCut and 200-node Maximum Independent Set on IBM Quantum hardware. The post JIJ Launches SQOA Solver in IBM Quantum Functions Catalog to Tackle Combinatorial Optimization Beyond Qubit Counts appeared first on Quantum Computing Report .