Metraipolis › archive › dc_e8512dd6007a
Probabilistic Algorithms for Ising Machines from Optimization to Generative AI — arXiv:2610.03972
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.03972
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:30:20.776Z
- SHA-256 of the archived text
27762f46e203fbf4174eb230f711681d976078a695a6c86b81b7cbffe35d0754- Stable URL of this page
https://metraipolis.com/documento/dc_e8512dd6007a
How to cite
Probabilistic Algorithms for Ising Machines from Optimization to Generative AI — arXiv:2610.03972 — arXiv, https://arxiv.org/abs/2610.03972 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e8512dd6007a (Metraipolis archive dc_e8512dd6007a, sha256 27762f46e203fbf4174eb230f711681d976078a695a6c86b81b7cbffe35d0754)
BibTeX
@misc{dce8512dd6007a,
title = {Probabilistic Algorithms for Ising Machines from Optimization to Generative AI — arXiv:2610.03972},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.03972},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e8512dd6007a; sha256 27762f46e203fbf4174eb230f711681d976078a695a6c86b81b7cbffe35d0754},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.03972. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Ising machines have emerged as promising hardware accelerators for intractable optimization and sampling problems, yet their practical impact increasingly hinges on the co-design of algorithms and hardware, where algorithmic demands shape new architectures and new hardware capabilities inspire entirely new algorithms. In this Review, we survey probabilistic algorithms designed for portability across diverse Ising platforms, advocating a top-down perspective that prioritizes principled methods with provable guarantees. We cover foundational methods such as simulated annealing and parallel tempering, including two-dimensional extensions that natively encode hard constraints, and examine approaches that expand the scale of solvable problems from cluster mean-field methods to variational samplers. We highlight the Probabilistic Approximate Optimization Algorithm (PAOA), a classical analog of QAOA that emerged directly from probabilistic hardware development, and explore how generative AI and Ising machines might reinforce each other: learned models propose global moves to accelerate optimization, while probabilistic techniques improve inference in large language models. Much as quantum computing has seen algorithms co-evolve with hardware, probabilistic and Ising computing stand at a similar inflection point. We outline a co-design framework for accelerating the capabilities and adoption of next-generation Ising machines. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Disordered Systems and Neural Networks (cond-mat.dis-nn); Statistical Mechanics (cond-mat.stat-mech); Emerging Technologies (cs.ET). Pagina del lavoro: https://arxiv.org/abs/2610.03972 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:27:05.644Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).