Non-binary dynamical Ising machines for combinatorial optimization

Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous dynamical systems. The main adapted principle guiding the design of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Physica. D Jg. 481; S. 134809
Hauptverfasser:	Shukla, Aditya, Erementchouk, Mikhail, Mazumder, Pinaki
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2025
Schlagworte:	Combinatorial optimization Graph coloring Ising machines Latin squares Quadratic unconstrained binary optimization Latin squares Ising machines Graph coloring Combinatorial optimization Quadratic unconstrained binary optimization
ISSN:	0167-2789
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!