Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

  • Article
  • Published:

An Ising solver chip based on coupled ring oscillators with a 48-node all-to-all connected array architecture

Abstract

Quantum-inspired computing systems can be used to efficiently solve combinatorial optimization problems. In developing such systems, a key challenge is the creation of large hardware topologies with all-to-all node connectivity that allow arbitrary problem graphs to be directly mapped to the hardware. Here we report a physics-based Ising solver chip fabricated in a standard 1.2 V, 65 nm complementary metal–oxide–semiconductor technology. The chip features an all-to-all architecture with 48 spins and a highly uniform coupling circuit with integer weights ranging from −14 to +14. The all-to-all architecture strongly couples a horizontal oscillator with a vertical oscillator so that each horizontal–vertical oscillator pair intersects with all the other pairs in a crossbar-style array and allows any graph with up to 48 nodes to be directly mapped to the hardware. We use the Ising solver chip to carry out statistical measurements for different problem sizes, graph densities, operating temperatures and problem instances.

This is a preview of subscription content, access via your institution

Access options

Buy this article

Prices may be subject to local taxes which are calculated during checkout

Fig. 1: Ising solver compute flow, connectivity comparison table and minor embedding examples.
Fig. 2: Proposed all-to-all array architecture and chip layout.
Fig. 3: Proposed multibit coupling-weight circuit and weight configurations.
Fig. 4: Statistical data collected from the all-to-all Ising solver chip.
Fig. 5: Number of spins and coupling-weight resolution can be dynamically reconfigured by software.

Similar content being viewed by others

Data availability

Graph data/problem sets and test data presented in this paper are available via figshare at https://figshare.com/projects/A_48-node_All-to-all_Connected_Coupled_Ring_Oscillator_Ising_Solver_Chip/173382Source data are provided with this paper.

Code availability

The testing program used to compare the Ising chip solutions with the qbsolv 0.3.4. software solutions is available via figshare at https://figshare.com/projects/A_48-node_All-to-all_Connected_Coupled_Ring_Oscillator_Ising_Solver_Chip/173382.

References

  1. Glover, F., Kochenberger, G. & Du, Y. A tutorial on formulating and using QUBO models. Preprint at https://arxiv.org/abs/1811.11538 (2018).

  2. Mohseni, N., McMahon, P. L. & Byrnes, T. Ising machines as hardware solvers of combinatorial optimization problems. Nat. Rev. Phys. 4, 363–379 (2022).

    Article  Google Scholar 

  3. Yamaoka, M. et al. A 20k-spin Ising chip to solve combinatorial optimization problems with cmos annealing. IEEE J. Solid-State Circuits 51, 303–309 (2015).

    Google Scholar 

  4. Takemoto, T., Hayashi, M., Yoshimura, C. & Yamaoka, M. A 2×30k spin multichip scalable annealing processor based on a processing-in-memory approach for solving large scale combinatorial optimization problems. In 2019 IEEE International Solid-State Circuits Conference (ISSCC) 52–54 (IEEE, 2019).

  5. Yamamoto, K. et al. STATICA: a 512-spin 0.25 M-weight annealing processor with an all-spin-updates-at-once architecture for combinatorial optimization with complete spin–spin interactions. IEEE J. Solid-State Circuits 56, 165–178 (2020).

    Article  Google Scholar 

  6. Matsubara, S. et al. Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In 2020 Asia and South Pacific Design Automation Conference (ASP-DAC) 667–672 (IEEE, 2020).

  7. Cipra, B. A. An introduction to the Ising model. Amer. Math. Monthly 94, 937–959 (1987).

    Article  MathSciNet  Google Scholar 

  8. Lucas, A. Ising formulations of many NP problems. Front. Phys. 2, 5 (2014).

    Article  Google Scholar 

  9. Johnson, M. W. et al. Quantum annealing with manufactured spins. Nature 473, 194–198 (2011).

    Article  Google Scholar 

  10. Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).

    Article  Google Scholar 

  11. Osaba, E., Villar-Rodriguez, E., Oregi, I. & Moreno-Fernandez-de Leceta, A. Hybrid quantum computing—tabu search algorithm for partitioning problems: preliminary study on the traveling salesman problem. In 2021 IEEE Congress on Evolutionary Computation (CEC) 351–358 (IEEE, 2021).

  12. Boothby, K., Bunyk, P., Raymond, J. & Roy, A. Next-generation topology of D-Wave quantum processors. Preprint at https://arxiv.org/abs/2003.00133 (2020).

  13. Patton, R. et al. Efficiently embedding QUBO problems on adiabatic quantum computers. Quantum Inf. Process. 18, 117 (2019).

    Article  MATH  Google Scholar 

  14. Tanaka, S., Matsuda, Y. & Togawa, N. Theory of Ising machines and a common software platform for Ising machines. In 2020 Asia and South Pacific Design Automation Conference (ASP-DAC) 659–666 (IEEE, 2020).

  15. Takemoto, T. et al. A 144Kb annealing system composed of 9×16Kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems. In 2021 IEEE International Solid-State Circuits Conference (ISSCC) 64–66 (IEEE, 2021).

  16. Hamerly, R. et al. Experimental investigation of performance differences between coherent Ising machines and a quantum annealer. Sci. Adv. 5, eaau0823 (2019).

    Article  Google Scholar 

  17. Yamamoto, Y. et al. Coherent Ising machines—optical neural networks operating at the quantum limit. npj Quantum Inf. 3, 49 (2017).

    Article  Google Scholar 

  18. Honjo, T. et al. 100,000-spin coherent Ising machine. Sci. Adv. 7, eabh0952 (2021).

  19. Moy, W. et al. A 1,968-node coupled ring oscillator circuit for combinatorial optimization problem solving. Nat. Electron. 5, 310–317 (2022).

    Article  Google Scholar 

  20. Ahmed, I., Chiu, P.-W., Moy, W. & Kim, C. H. A probabilistic compute fabric based on coupled ring oscillators for solving combinatorial optimization problems. IEEE J. Solid-State Circuits 56, 2870–2880 (2021).

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the DARPA Quantum-inspired Classical Computing (QuICC) program under AFRL contract FA8750-22-C-1034. H.L. was supported in part by the University of Minnesota College of Science and Engineering Graduate Fellowship.

Author information

Authors and Affiliations

Authors

Contributions

H.L., W.M. and C.H.K. collaborated on the circuit and architecture designs of the integrated circuit. H.L. and H.Y. were responsible for creating the layout for the fabrication process. H.L. led the testing and characterization of the chip, whereas H.L., W.M., S.S. and C.H.K. jointly analysed the test data. The paper was primarily authored by H.L. and C.H.K., with W.M. and S.S. contributing to its editing and revision.

Corresponding author

Correspondence to Chris H. Kim.

Ethics declarations

Competing interests

The authors declare the following competing interest: US patent application no. 17/975,825 (Circuit having fully connected ring oscillators).

Peer review

Peer review information

Nature Electronics thanks Kazushi Kawamura, Dmitri Nikonov, and the other, anonymous, reviewer(s) for their contribution to the peer review of this work.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Source data

Source Data Figs. 4 and 5

Raw data used to plot Figs. 4 and 5 in CSV format.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lo, H., Moy, W., Yu, H. et al. An Ising solver chip based on coupled ring oscillators with a 48-node all-to-all connected array architecture. Nat Electron 6, 771–778 (2023). https://doi.org/10.1038/s41928-023-01021-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1038/s41928-023-01021-y

This article is cited by

Search

Quick links

Nature Briefing AI and Robotics

Sign up for the Nature Briefing: AI and Robotics newsletter — what matters in AI and robotics research, free to your inbox weekly.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing: AI and Robotics