Multi Digit Ising Mapping for Low Precision Ising Solvers
Abhishek Kumar Singh, Kyle Jamieson
TL;DR
The paper addresses the precision gap in hardware Ising solvers by introducing a Multi-digit Ising mapping that artificially increases effective precision without hardware changes. It formalizes base-$q$ digit encoding (including 2-digit and 3-digit variants) to represent problem coefficients, introducing spin copies and penalty terms to realize higher precision while keeping coefficient ranges manageable. The approach is instantiated for DI-MIMO on a COBI Ising solver, achieving notable BER improvements in small MIMO configurations with 16-QAM under no-noise conditions. This technique broadens the practical impact of low-precision Ising hardware for hard problems like MIMO detection by bridging the gap between software-predicted gains and hardware realizations.
Abstract
The last couple of years have seen an ever-increasing interest in using different Ising solvers, like Quantum annealers, Coherent Ising machines, and Oscillator-based Ising machines, for solving tough computational problems in various domains. Although the simulations predict massive performance improvements for several tough computational problems, the real implementations of the Ising solvers tend to have limited precision, which can cause significant performance deterioration. This paper presents a novel methodology for mapping the problem on the Ising solvers to artificially increase the effective precision. We further evaluate our method for the Multiple-Input-Multiple-Output signal detection problem.
