Ising Hamiltonian Minimization: Gain-Based Computing with Manifold Reduction of Soft-Spins vs Quantum Annealing
Abstract
We investigate the minimization of Ising Hamiltonians, comparing the performance of gain-based computing paradigms based on the dynamics of semi-classical soft-spin models with quantum annealing. We systematically analyze how the energy landscape for the circulant couplings of a Mobius graph evolves with increased annealing parameters. Our findings indicate that these semi-classical models face challenges due to a widening dimensionality landscape. To counteract this issue, we introduce the `manifold reduction' method, which restricts the soft-spin amplitudes to a defined phase space region. Concurrently, quantum annealing demonstrates a natural capability to navigate the Ising Hamiltonian's energy landscape due to its operation within the comprehensive Hilbert space. Our study indicates that physics-inspired or physics-enhanced optimizers will likely benefit from combining classical and quantum annealing techniques.
Keywords
Cite
@article{arxiv.2311.17359,
title = {Ising Hamiltonian Minimization: Gain-Based Computing with Manifold Reduction of Soft-Spins vs Quantum Annealing},
author = {James S. Cummins and Hayder Salman and Natalia G. Berloff},
journal= {arXiv preprint arXiv:2311.17359},
year = {2025}
}
Comments
12 pages, 12 figures; published by Phys. Rev. Research 7, 013150 (2025)