vix.ing · top · new · best · stats · spec

Complex Vector Gain-Based Annealer for Minimizing XY Hamiltonians

2024/11/04 by James Cummins, Natalia G. Berloff, Cummins, James S. +1 · 1 citation
Engineering · #Adaptation and Self-Organizing Systems (nlin.AO) #Control and Stability of Dynamical Systems #Disordered Systems and Neural Networks (cond-mat.dis-nn) #Electromagnetic Simulation and Numerical Methods #Emerging Technologies (cs.ET) #FOS: Computer and information sciences #FOS: Physical sciences #Optics (physics.optics) #Other Condensed Matter (cond-mat.other) #Particle Accelerators and Free-Electron Lasers

paper · pdf · doi:10.48550/arxiv.2411.02010

openalex publication_date 2024/11/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents the Complex Vector Gain-Based Annealer (CoVeGA), an analog computing platform designed to overcome energy barriers in XY Hamiltonians through a higher-dimensional representation. Traditional gain-based solvers utilizing optical or photonic hardware typically represent each XY spin with a single complex field. These solvers often struggle with large energy barriers in complex landscapes, leading to relaxation into excited states. CoVeGA addresses these limitations by employing two complex fields to represent each XY spin and dynamically evolving the energy landscape through time-dependent annealing. Operating in a higher-dimensional space, CoVeGA bridges energy barriers in this expanded space during the continuous phase evolution, thus avoiding entrapment in local minima. We introduce several graph structures that pose challenges for XY minimization and use them to benchmark CoVeGA against single-dimension XY solvers, highlighting the benefits of higher-dimensional operation.

Cited by

Related