Noise-augmented chaotic Ising machines for combinatorial optimization and sampling
Abstract Ising machines are hardware accelerators for combinatorial optimization and probabilistic sampling, using stochasticity to explore spin configurations and avoid local minima. We refine the previously proposed coupled chaotic bits (c-bits), which operate deterministically, by introducing noi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-01-01
|
| Series: | Communications Physics |
| Online Access: | https://doi.org/10.1038/s42005-025-01945-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832585612650086400 |
|---|---|
| author | Kyle Lee Shuvro Chowdhury Kerem Y. Camsari |
| author_facet | Kyle Lee Shuvro Chowdhury Kerem Y. Camsari |
| author_sort | Kyle Lee |
| collection | DOAJ |
| description | Abstract Ising machines are hardware accelerators for combinatorial optimization and probabilistic sampling, using stochasticity to explore spin configurations and avoid local minima. We refine the previously proposed coupled chaotic bits (c-bits), which operate deterministically, by introducing noise. This improves performance in combinatorial optimization, achieving algorithmic scaling comparable to probabilistic bits (p-bits). We show that c-bits follow the quantum Boltzmann law in a 1D transverse field Ising model. Furthermore, c-bits exhibit critical dynamics similar to p-bits in 2D Ising and 3D spin glass models. Finally, we propose a noise-augmented c-bit approach via the adaptive parallel tempering algorithm (APT), which outperforms fully deterministic c-bits running simulated annealing. Analog Ising machines with coupled oscillators could draw inspiration from our approach, as running replicas at constant temperature eliminates the need for global modulation of coupling strengths. Ultimately, mixing stochasticity with deterministic c-bits yields a powerful hybrid computing scheme that can offer benefits in asynchronous, massively parallel hardware implementations. |
| format | Article |
| id | doaj-art-06a8ff43b2c64449b95cac578243e648 |
| institution | Kabale University |
| issn | 2399-3650 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Communications Physics |
| spelling | doaj-art-06a8ff43b2c64449b95cac578243e6482025-01-26T12:37:08ZengNature PortfolioCommunications Physics2399-36502025-01-018111110.1038/s42005-025-01945-1Noise-augmented chaotic Ising machines for combinatorial optimization and samplingKyle Lee0Shuvro Chowdhury1Kerem Y. Camsari2Department of Electrical and Computer Engineering, University of California, Santa BarbaraDepartment of Electrical and Computer Engineering, University of California, Santa BarbaraDepartment of Electrical and Computer Engineering, University of California, Santa BarbaraAbstract Ising machines are hardware accelerators for combinatorial optimization and probabilistic sampling, using stochasticity to explore spin configurations and avoid local minima. We refine the previously proposed coupled chaotic bits (c-bits), which operate deterministically, by introducing noise. This improves performance in combinatorial optimization, achieving algorithmic scaling comparable to probabilistic bits (p-bits). We show that c-bits follow the quantum Boltzmann law in a 1D transverse field Ising model. Furthermore, c-bits exhibit critical dynamics similar to p-bits in 2D Ising and 3D spin glass models. Finally, we propose a noise-augmented c-bit approach via the adaptive parallel tempering algorithm (APT), which outperforms fully deterministic c-bits running simulated annealing. Analog Ising machines with coupled oscillators could draw inspiration from our approach, as running replicas at constant temperature eliminates the need for global modulation of coupling strengths. Ultimately, mixing stochasticity with deterministic c-bits yields a powerful hybrid computing scheme that can offer benefits in asynchronous, massively parallel hardware implementations.https://doi.org/10.1038/s42005-025-01945-1 |
| spellingShingle | Kyle Lee Shuvro Chowdhury Kerem Y. Camsari Noise-augmented chaotic Ising machines for combinatorial optimization and sampling Communications Physics |
| title | Noise-augmented chaotic Ising machines for combinatorial optimization and sampling |
| title_full | Noise-augmented chaotic Ising machines for combinatorial optimization and sampling |
| title_fullStr | Noise-augmented chaotic Ising machines for combinatorial optimization and sampling |
| title_full_unstemmed | Noise-augmented chaotic Ising machines for combinatorial optimization and sampling |
| title_short | Noise-augmented chaotic Ising machines for combinatorial optimization and sampling |
| title_sort | noise augmented chaotic ising machines for combinatorial optimization and sampling |
| url | https://doi.org/10.1038/s42005-025-01945-1 |
| work_keys_str_mv | AT kylelee noiseaugmentedchaoticisingmachinesforcombinatorialoptimizationandsampling AT shuvrochowdhury noiseaugmentedchaoticisingmachinesforcombinatorialoptimizationandsampling AT keremycamsari noiseaugmentedchaoticisingmachinesforcombinatorialoptimizationandsampling |