Vector Ising Spin Annealer for Minimizing Ising Hamiltonians
Abstract: We introduce the Vector Ising Spin Annealer (VISA), a framework in gain-based computing that harnesses light-matter interactions to solve complex optimization problems encoded in spin Hamiltonians. Traditional driven-dissipative systems often select excited states due to limitations in spin movement. VISA transcends these constraints by enabling spins to operate in a three-dimensional space, offering a robust solution to minimize Ising Hamiltonians effectively. Our comparative analysis reveals VISA's superior performance over conventional single-dimension spin optimizers, demonstrating its ability to bridge substantial energy barriers in complex landscapes. Through detailed studies on cyclic and random graphs, we show VISA's proficiency in dynamically evolving the energy landscape with time-dependent gain and penalty annealing, illustrating its potential to redefine optimization in physical systems.
- N. C. Thompson and S. Spanuth, Communications of the ACM 64, 64 (2021).
- A. Lucas, Frontiers in physics 2, 5 (2014).
- G. De las Cuevas and T. S. Cubitt, Science 351, 1180 (2016).
- N. A. Pierce and E. Winfree, Protein engineering 15, 779 (2002).
- M. Calvanese Strinati and C. Conti, Nature Communications 13, 7248 (2022).
- M. C. Strinati and C. Conti, Physical Review Letters 132, 017301 (2024).
- K. P. Kalinin and N. G. Berloff, New Journal of Physics 20, 113023 (2018).
- N. Stroev and N. G. Berloff, Physical Review Letters 126, 050504 (2021).
- I. G. Rosenberg, (1975).
- E. Boros and P. L. Hammer, Discrete applied mathematics 123, 155 (2002).
- J. J. Hopfield, Proceedings of the national academy of sciences 79, 2554 (1982).
- J. J. Hopfield and D. W. Tank, Biological cybernetics 52, 141 (1985).
- H. Goto, Scientific reports 6, 1 (2016).
- K. P. Kalinin and N. G. Berloff, Communications Physics 5, 20 (2022).
- A. Orvieto and A. Lucchi, Advances in Neural Information Processing Systems 32 (2019).
- J.-R. Jiang and C.-W. Chu, in 2022 IEEE 4th ECICE (IEEE, 2022) pp. 406–411.
- The BFGS algorithm is implemented with minimizer FindMinimum in Wolfram Mathematica. VISA Hamiltonian HVISAsubscript𝐻VISAH_{\rm VISA}italic_H start_POSTSUBSCRIPT roman_VISA end_POSTSUBSCRIPT is subject to BFGS with fixed γi=γ=1.0∀isubscript𝛾𝑖𝛾1.0for-all𝑖\gamma_{i}=\gamma=1.0\forall iitalic_γ start_POSTSUBSCRIPT italic_i end_POSTSUBSCRIPT = italic_γ = 1.0 ∀ italic_i and P=0.8𝑃0.8P=0.8italic_P = 0.8.
- J. Gancio and N. Rubido, Chaos, Solitons & Fractals 158, 112001 (2022).
- Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” (2023).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.