factual
Optimization problems map to non-local spin systems
A whole class of optimization problems—travelling-salesman-type and certain scheduling problems—can be mapped to minimizing the energy of an interacting spin system, which generically requires spins with programmable non-local interactions whose graph and sign (whether spins align or anti-align, and how strongly) must be controllable; this makes cold-atom systems with programmable non-local interactions a natural platform to explore whether they can efficiently solve classically hard problems.
factualpending
Speaker
Monika Schleier-SmithEvidence Quote
“there's a whole class of optimization problems that can be mapped to essentially minimizing the energy of an interacting spin system”
Created: 6/13/2026, 12:07:09 AM
Your notes
Loading notes...