IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v16y2025i1d10.1038_s41467-025-58231-5.html
   My bibliography  Save this article

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

Author

Listed:
  • Zihao Chen

    (Washington University in St. Louis)

  • Zhili Xiao

    (Washington University in St. Louis)

  • Mahmoud Akl

    (SpiNNcloud Systems GmbH)

  • Johannes Leugring

    (University of California San Diego)

  • Omowuyi Olajide

    (University of California San Diego)

  • Adil Malik

    (Imperial College London)

  • Nik Dennler

    (Western Sydney University, Penrith
    University of Hertfordshire)

  • Chad Harper

    (University of California, Berkeley
    University of California, Berkeley)

  • Subhankar Bose

    (Washington University in St. Louis)

  • Hector A. Gonzalez

    (SpiNNcloud Systems GmbH
    Technische Universität Dresden)

  • Mohamed Samaali

    (SpiNNcloud Systems GmbH)

  • Gengting Liu

    (SpiNNcloud Systems GmbH)

  • Jason Eshraghian

    (University of California, Santa Cruz)

  • Riccardo Pignari

    (Politecnico di Torino)

  • Gianvito Urgese

    (Politecnico di Torino)

  • Andreas G. Andreou

    (Johns Hopkins University)

  • Sadasivan Shankar

    (SLAC National Accelerator Laboratory
    Stanford University)

  • Christian Mayr

    (Technische Universität Dresden
    Scads.AI: Center for Scalable Data Analytics and Artificial Intelligence)

  • Gert Cauwenberghs

    (University of California San Diego)

  • Shantanu Chakrabartty

    (Washington University in St. Louis)

Abstract

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

Suggested Citation

  • Zihao Chen & Zhili Xiao & Mahmoud Akl & Johannes Leugring & Omowuyi Olajide & Adil Malik & Nik Dennler & Chad Harper & Subhankar Bose & Hector A. Gonzalez & Mohamed Samaali & Gengting Liu & Jason Eshr, 2025. "ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers," Nature Communications, Nature, vol. 16(1), pages 1-13, December.
  • Handle: RePEc:nat:natcom:v:16:y:2025:i:1:d:10.1038_s41467-025-58231-5
    DOI: 10.1038/s41467-025-58231-5
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-025-58231-5
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1038/s41467-025-58231-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Mingrui Jiang & Keyi Shan & Chengping He & Can Li, 2023. "Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar," Nature Communications, Nature, vol. 14(1), pages 1-11, December.
    2. Darshit Mehta & Mustafizur Rahman & Kenji Aono & Shantanu Chakrabartty, 2022. "An adaptive synaptic array using Fowler–Nordheim dynamic analog memory," Nature Communications, Nature, vol. 13(1), pages 1-11, December.
    3. David Layden & Guglielmo Mazzola & Ryan V. Mishmash & Mario Motta & Pawel Wocjan & Jin-Sung Kim & Sarah Sheldon, 2023. "Quantum-enhanced Markov chain Monte Carlo," Nature, Nature, vol. 619(7969), pages 282-287, July.
    4. Olivier Maher & Manuel Jiménez & Corentin Delacour & Nele Harnack & Juan Núñez & María J. Avedillo & Bernabé Linares-Barranco & Aida Todri-Sanial & Giacomo Indiveri & Siegfried Karg, 2024. "A CMOS-compatible oscillation-based VO2 Ising machine solver," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    5. Jason Yik & Korneel Berghe & Douwe Blanken & Younes Bouhadjar & Maxime Fabre & Paul Hueber & Weijie Ke & Mina A. Khoei & Denis Kleyko & Noah Pacik-Nelson & Alessandro Pierro & Philipp Stratmann & Pao-, 2025. "The neurobench framework for benchmarking neuromorphic computing algorithms and systems," Nature Communications, Nature, vol. 16(1), pages 1-24, December.
    6. Darshit Mehta & Kenji Aono & Shantanu Chakrabartty, 2020. "A self-powered analog sensor-data-logging device based on Fowler-Nordheim dynamical systems," Nature Communications, Nature, vol. 11(1), pages 1-9, December.
    7. Bruce Hajek, 1988. "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 311-329, May.
    8. Nihal Sanjay Singh & Keito Kobayashi & Qixuan Cao & Kemal Selcuk & Tianrui Hu & Shaila Niazi & Navid Anjum Aadit & Shun Kanai & Hideo Ohno & Shunsuke Fukami & Kerem Y. Camsari, 2024. "CMOS plus stochastic nanomagnets enabling heterogeneous computers for probabilistic inference and learning," Nature Communications, Nature, vol. 15(1), pages 1-9, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    2. Stoica, R.S. & Gregori, P. & Mateu, J., 2005. "Simulated annealing and object point processes: Tools for analysis of spatial patterns," Stochastic Processes and their Applications, Elsevier, vol. 115(11), pages 1860-1882, November.
    3. George Kapetanios, 2005. "Variable Selection using Non-Standard Optimisation of Information Criteria," Working Papers 533, Queen Mary University of London, School of Economics and Finance.
    4. Souvik Das & Ashwin Aravind & Ashish Cherukuri & Debasish Chatterjee, 2022. "Near-optimal solutions of convex semi-infinite programs via targeted sampling," Annals of Operations Research, Springer, vol. 318(1), pages 129-146, November.
    5. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    6. John Daniel & Zheng Sun & Xuejian Zhang & Yuanqiu Tan & Neil Dilley & Zhihong Chen & Joerg Appenzeller, 2024. "Experimental demonstration of an on-chip p-bit core based on stochastic magnetic tunnel junctions and 2D MoS2 transistors," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    7. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    8. Löwe, Matthias, 1997. "On the invariant measure of non-reversible simulated annealing," Statistics & Probability Letters, Elsevier, vol. 36(2), pages 189-193, December.
    9. Miclo, Laurent, 1995. "Remarques sur l'ergodicité des algorithmes de recuit simulé sur un graphe," Stochastic Processes and their Applications, Elsevier, vol. 58(2), pages 329-360, August.
    10. Kapetanios, George, 2006. "Cluster analysis of panel data sets using non-standard optimisation of information criteria," Journal of Economic Dynamics and Control, Elsevier, vol. 30(8), pages 1389-1408, August.
    11. Antonio Jiménez-Martín & Alfonso Mateos & Josefa Z. Hernández, 2021. "Aluminium Parts Casting Scheduling Based on Simulated Annealing," Mathematics, MDPI, vol. 9(7), pages 1-18, March.
    12. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    13. Zhang Lihao & Ye Zeyang & Deng Yuefan, 2019. "Parallel MCMC methods for global optimization," Monte Carlo Methods and Applications, De Gruyter, vol. 25(3), pages 227-237, September.
    14. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
    15. Broekmeulen, Rob A. C. M. & van Weert, Arjen & Saedt, Anton P. H., 2002. "Comparing three alternative optimisation methods for the treatment planning of bulbs," Agricultural Systems, Elsevier, vol. 72(1), pages 59-71, April.
    16. F. R. B. Cruz & A. R. Duarte & G. L. Souza, 2018. "Multi-objective performance improvements of general finite single-server queueing networks," Journal of Heuristics, Springer, vol. 24(5), pages 757-781, October.
    17. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
    18. Doole, Graeme J., 2007. "A primer on implementing compressed simulated annealing for the optimisation of a constrained simulation model in Microsoft Excel," Working Papers 7420, University of Western Australia, School of Agricultural and Resource Economics.
    19. Sam Hui & Eric Bradlow, 2012. "Bayesian multi-resolution spatial analysis with applications to marketing," Quantitative Marketing and Economics (QME), Springer, vol. 10(4), pages 419-452, December.
    20. Zhao, Fang & Zeng, Xiaogang, 2008. "Optimization of transit route network, vehicle headways and timetables for large-scale transit networks," European Journal of Operational Research, Elsevier, vol. 186(2), pages 841-855, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:natcom:v:16:y:2025:i:1:d:10.1038_s41467-025-58231-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.