Complex Vector Gain-Based Annealer for Minimizing XY Hamiltonians
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.