Design of Magnetic Lattices with Quantum Optimization Algorithms
Zekeriya Ender Eğer, Waris Khan, Priyabrata Maharana, Kandula Eswara Sai Kumar, Udbhav Sharma, Abhishek Chopra, Rut Lineswala, Pınar Acar
TL;DR
The paper addresses identifying magnetic spin configurations on 2D lattices by minimizing the Ising energy $H = - ω_j sum_{<i,j>} σ_i σ_j - h sum_i σ_i$ under uncertainty, incorporating Gaussian long-range couplings and a temperature-/field-induced variability. It introduces quantum-inspired optimization via the BQPhy/QIEO framework to navigate the $2^{n^2}$ design space, contrasting with a classical genetic algorithm and showing comparable optima with substantially reduced compute time, scalable to lattices up to $50 \times 50$. By leveraging Latin Hypercube Sampling of 3,000 uncertainty realizations and a probabilistic qubit representation, the approach demonstrates significant speedups while preserving solution quality, highlighting the practicality of quantum-inspired methods for complex Hamiltonian landscapes. The work suggests hybrid quantum-inspired strategies as viable intermediate solutions before wide-access to quantum hardware, with implications for scalable magnetic materials design under uncertainty.
Abstract
This article investigates the identification of magnetic spin distributions in ferromagnetic materials by minimizing the system's free energy. Magnetic lattices of varying sizes are constructed, and the free energy is computed using an Ising model that accounts for spin-to-spin neighbor interactions and the influence of an external magnetic field. The problem reduces to determining the state of each spin, either up or down, leading to an optimization problem with $2^{n \times n}$ design variables for an $n \times n$ lattice. To address the high-dimensional and computationally intractable nature of this problem, particularly for large domains, we employ a quantum optimization algorithm, BQP. The BQP results are first validated against solutions obtained using a genetic algorithm for smaller lattices. Finally, the approach is extended to large-scale systems, including $50 \times 50$ lattices, where conventional methods become impractical.
