Abstract
Ising Machines (IMs) have the potential to outperform conventional Von-Neuman architectures in notoriously difficult optimization problems. Various IM implementations have been proposed based on quantum, optical, digital and analog CMOS, as well as emerging technologies. Networks of coupled electronic oscillators have recently been shown to exhibit characteristics required for implementing IMs. However, for this approach to successfully solve complex optimization problems, a highly reconfigurable implementation is needed. In this work, the possibility of implementing highly reconfigurable oscillator-based IMs is explored. An implementation based on quasiperiodically modulated coupling strength through a common medium is proposed and its potential is demonstrated through numerical simulations. Moreover, a proof-of-concept implementation based on CMOS coupled ring oscillators is proposed and its functionality is demonstrated. Simulation results show that our proposed architecture can consistently find the Max-Cut solution and demonstrate the potential to greatly simplify the physical implementation of highly reconfigurable oscillator-based IMs.
Similar content being viewed by others
Introduction
Unconventional computing paradigms based on natural processes have recently inspired the development of various hardware architectures, which can potentially outperform conventional Von-Neuman architectures for various applications, including machine learning1,2, chemistry3,4 and planning5. Ising Machines (IMs) belong to the class of architectures that employs the Ising Model for solving optimization problems. Optimization problems often rely on finding the global minimum in a multivariate energy landscape similar to the Ising Model. This analogy has been demonstrated by mapping various practically relevant optimization problems to the Ising Model6. Therefore, hardware architectures specifically designed to solve the Ising Model are considered as general purpose optimization solvers known as IMs.
The most widely known IMs are quantum annealers7,8,9, which are currently commercially available by D-Wave10. These systems are based on coupled Josephson junctions and have shown promising results as the first step to quantum computing11. For instance, the new D-Wave architecture includes more than 5000 qubits which in combination with their tools can solve optimization problems with up to a million variables10. However, quantum annealers operate at extremely low temperatures (sub Kelvin) requiring large cooling facilities and kilowatts of power, limiting the possibility of miniaturization.
Coherent Ising Machines (CIM)12,13,14 are based on degenerate optical parametric oscillators, which in combination with time-multiplexing allow for problems with thousands of variables to be solved14. However, CIM also have their specific challenges since they require long optical cables.
Digital CMOS IMs15,16,17,18,19,20,21,22, which are generally based on simulating systems that can solve the Ising Model, have been extensively studied in recent years. This approach comes with the advantages of using commercially available CMOS processes and consequently allow for rapid development and miniaturization.
Various analog based IMs23,24,25,26,27 have been also proposed. The proposal in27 utilizes coupled LC electronic oscillator networks for implementing an IM. This approach has recently been further investigated by the research community28,29,30,31,32,33,34 since it brings advantages including its potential for on chip implementation using CMOS technologies and low power consumption.
In recent years, emerging technologies, such as memristive35,36, p-bit37,38, spintronic oscillators39,40,41 and phase change oscillators42,43, have been also explored for implementing IMs.
A common design challenge affecting many of the previously discussed implementations is the number of coupling elements needed to implement IMs. Moreover, these couplings need to be highly reconfigurable to realize a general purpose IM. In this work, we investigate the possibility of implementing oscillator-based IMs with highly reconfigurable connectivity utilizing quasiperiodic modulation of the coupling strength. A similar approach has previously been explored for realizing oscillatory neuro computers44,45,46 and to achieve reconfigurability in quantum annealers based on Josephson parametric oscillators47. The proposed approach is analysed by using a network of Kuramoto oscillators. Further, a scaling scheme for large networks required for solving complex optimization problems is proposed. Finally, a proof-of-concept implementation based on CMOS RC ring oscillators is proposed and demonstrated.
Theory
The Ising Model describes a discrete magnetic system, where spins s settle to a binary state \(\{+1,-1\}\). The Hamiltonian describing the energy of a spin configuration can be written as:
where N is the number of spins, \(J_{i,j}\) is the coupling between spins i, j and \(h_i\) is the interaction to an external field. However, for the following discussion, we consider \(h_i = 0\). Oscillator-based IMs are based on the similarities between the Ising Model and the phase evolution of a synchronized oscillator network under second harmonic injection locking (SHIL), operating at the same frequency \(\omega\). Considering a network of coupled Kuramoto oscillators48, the differential equations describing the phase evolution in a rotating frame \(\theta _i(t) = \phi _i(t)-\omega t\) can be written as27,49:
where \(\theta _i\) is the phase in the rotating frame, \(K_{s}\) is the coupling strength to the SHIL, which is an externally applied signal at twice the fundamental frequency, \(\omega _e=2\omega\), and \(K_{i,j}\) is the coupling between oscillators i, j. The relation between (2) and the Ising Model in (1) can be understood through the graphical illustration presented in Fig. 1 (for simplicity, only four coupled SHIL oscillators are considered). When an oscillator is perturbed at a frequency equal to its operating frequency \(\omega\), it approaches a phase locked state relative to the external signal, e.g. at \(0^\circ\) as is highlighted by the arrows and dot in Fig. 1a. Similarly, if it is perturbed at twice the fundamental, two stable phase states appear at \(0^\circ\) and \(180^\circ\) (as in Fig. 1b), as a consequence of the term proportional to \(sin(2\theta )\) in (2). In oscillator-based IMs, this bistability is used to represent the spin states in the Ising Hamiltonian (Eq. 1), where the oscillator settling to an odd/even multiple of \(\pi\) represents a spin state of \(+1/-1\). Finally, by coupling together a network of oscillators under SHIL, as presented in Fig. 1c, the phase dynamics become governed by (2) which has a global Lyapunov function equivalent to the Ising Hamiltonian27. Consequently, an oscillator-based IM can be realized with this relatively simple architecture. However, a major design challenge appears as the number of oscillators increases since N all-to-all connected oscillators require \(O(N(N-1))\) coupling elements. It is worth mentioning that in Fig. 1c only \(O(N(N-1)/2)\) bidirectional coupling elements are presented, but in circuit implementations \(O(N(N-1))\) unidirectional coupling elements are generally needed. This is graphically illustrated in Fig. 2a where an architecture for 6 all-to-all connected oscillators is presented. Moreover, for a general purpose oscillator-based IM these coupling elements need to be highly reconfigurable allowing couplings to be turned-off, to have both positive and negative sign and even multilevel amplitude. Here, we will address the reconfigurability aspect by exploring one potential approach inspired from an oscillatory neurocomputer proposal44. Conventional oscillator-based IMs described by (2) are based on the assumption that all oscillators are synchronized and operate at the same frequency \(\omega\). Consequently, in the rotating frame, the phase dynamics become governed by (2) which maps to (1) when the phases are binarized using SHIL. By substituting \(\theta _i(t) = \phi _i(t) - \omega t\) into (2) and assuming a uniform coupling strength \(K_{i,j} = K\) for all i, j, the phase dynamics in the stationary frame can be written as50:
By extending this model to include oscillators operating at different frequencies (\(\omega _i \ne \omega _j\)), with the minimum difference between any i and j given by \(\omega _{diff,min}\), and assuming that each oscillator i is perturbed by a separate second harmonic corresponding to twice its operating frequency \(2\omega _i\), (3) can simply be written as:
By re-writing (4) in the rotating frame where \(\phi _i(t) = \omega _i t +\theta _i(t)\) \((\phi _j(t) = \omega _j t + \theta _j(t))\) and \(d\phi _i(t)/dt = \omega _i+d\theta _i/dt\), the phase dynamics become:
At this point, it is worth highlighting that each phase \(\theta _i\) is in a different rotating frame since each oscillator operates at a different frequency \(\omega _i\). Moreover, assuming that the coupling K in the network is weak (\(K<<\omega _{diff,min}\)) and constant, the phase dynamics are relatively unaffected by the second term in (5)44. Consequently, under these conditions, the oscillators can be considered to be uncoupled. However, by modulating the coupling strength K with a quasiperiodic function a(t), given by (6a), (5) becomes (6b):
When \((\omega _i-\omega _j) \ne (\omega _k - \omega _l)\) for all frequency differences in the system, the average phase dynamics of (6b) over a long time-span (proportional to 1/K) become:
For full analysis of the averaging of (6b), the reader is referred to ’Supplementary material’. The average phase dynamics given by (7) closely resemble the original oscillator-based IM presented in (2). Consequently, a highly reconfigurable IM can be realized based on the modulation signal a(t), since the average coupling between oscillators in the network is purely determined by the coefficients \(c_{i,j}\) in (6a). This proposal largely resembles the oscillatory neurocomputer explored in44, but a SHIL signal is additionally applied to all oscillators. In conventional oscillator-based IMs as it is presented in Fig. 2a, \(O(N(N-1))\) coupling elements, connecting each oscillator to all others, are required. However, in the proposed implementation, oscillators are mutually connected to a single common coupling element that is modulated with \(O(N(N-1))\) frequency components, as it is presented in Fig. 2b. This approach largely moves the complexity outside the oscillator network itself. Any arbitrary network can be realized by simply tuning the amplitudes \(c_{i,j}\) of the modulation signals, which potentially allows for a scalable and flexible implementation. Nevertheless, the trade-off of this approach is that the phase dynamics evolve according to (7) on the slow time scale (proportional to 1/K), leading to slower convergence compared to conventional oscillator-based IM. However, the potential benefits of a greatly simplified implementation using this approach makes it worth exploring.
Results
Numerical simulations
To proof that the system in Fig. 2b can be employed for developing an IM, we performed numerical simulations of (6) solving Max-Cut problems. The Max-Cut problem consists of partitioning the vertexes of a graph into two subsets \(s_1\) and \(s_2\), maximizing the number of edges crossing between the two sets. A simple graph example consisting of 6 all-to-all connected vertexes is presented in Fig. 3a. This simple Max-Cut problem is undirected (\(c_{i,j} = c_{j,i}\)) and unweighted (all edges have the same weight \(c_{i,j}= 1\)). The Max-Cut solution of this graph, consisting of three vertexes in \(s_1\) while the other three in \(s_2\), is 9. Any other solution than three in each set has a lower cut value (number of edges crossing between the two sets). To map this problem to an oscillator-based IM, vertexes represent oscillators and edges negative (antiferromagnetic) couplings. In our proposal, the antiferromagnetic (ferromagnetic) couplings are realized by setting \(c_{i,j} = -1\) (\(c_{i,j} = 1\)), and \(c_{i,j} = 0\) if two nodes do not share an edge. The frequency of the oscillators, \(\omega _i\) (where \(i = 1,2,\ldots ,6\)), were chosen such that they form a Golomb ruler between \(\omega _1 = 2\pi \cdot 5\) MHz and \(\omega _6 = 2\pi \cdot 10\) MHz45:
where \(\left[ g_1,g_2, g_3, g_4, g_5, g_6 \right] = [0,1,4,10,12,17]\) is the Golomb ruler. This approach maximizes the difference between any pairs of oscillators in the network, (\(\omega _i-\omega _j\))45. Moreover, the coupling strength was chosen as \(K \approx \omega _{diff,min}/20\), where \(\omega _{diff,min} \approx 2\pi \cdot 0.3 MHz\), to achieve a weak coupling in the network, while the SHIL is ramped up as a function of time to binarize the phases in the system \(K_s = (0.5 K \cdot t)/t_{end}\), where \(t_{end}\) is the simulation time. Figure 3b shows the numerical simulation of the oscillator-based IM solving the graph in Fig. 3a, where the solution can be read by analyzing which oscillators settle to an odd/even multiple of \(\pi\) at the end of the simulation. In this specific case, three oscillators settle to \(\pi\) while three settle to \(0/2\pi\) corresponding to the Max-Cut solution. Figure 3c presents the solutions found for 100 independent simulation runs with random initial conditions, showing a \(96\%\) probability of finding the Max-Cut solution. To further verify that the couplings are determined by the modulation signal, we ran 100 simulations of 10 randomly generated graphs (total of 1000 runs) for various different simulation times. An example graph and the average probability of finding the Max-Cut solutions are presented in Fig. 3d. To map the random graphs to the oscillator-based IM, we simply turned off (by setting \(c_{i,j} = 0\)) the modulation signals corresponding to the absent edges in the graphs. The probability of finding the Max-Cut solution increases with the simulation time, which is generally also the case for conventional oscillator-based IMs. From the results presented in Fig. 3d, we can conclude that the approach presented Fig. 2b can be employed to realize a highly reconfigurable IM. Nevertheless, the need to distribute the operating frequencies according to a Golomb ruler for minimizing the unwanted couplings is a major disadvantage of this approach. As the number of oscillators increases, the operating frequency range \([\omega _{min},\omega _{max}]\) becomes impractical even for relatively small networks, limiting the experimental realization of oscillatory neurocomputers to small networks45. However, this approach is attractive for implementing IMs since IMs do not necessary require all-to-all connected networks as neurocomputers.
Our proposed architecture for implementing IM presented in Fig. 4a consists of hexagonal cells with six oscillators sharing a coupling network. This architecture allows for a scalable implementation, which brings the advantage of re-using operating frequencies of uncoupled oscillators. Moreover, the externally generated modulation signals can also be re-used between cells. However, the disadvantage of this approach is that each oscillator is now connected to twelve neighbouring oscillators (excluding boundary cases were it is less) instead of being all-to-all connected. This limits our implementation to graphs that can be mapped to the hexagonal grid. However, graph embedding techniques51 can potentially address this issue at the cost of additional pre-processing step and computational overhead51,52.
The functionality of the proposed architecture is demonstrated with numerical simulations. We generated ten random graphs for 2, 4, 6, 8 and 10 hexagonal cells and performed 100 simulation runs for each graph with random initial conditions. Figure 4b shows one of the ten graphs generated for ten hexagonal cells. Additionally, these simulations were performed for four different simulation times \(t_{end}\) = [200 \(\upmu\)s, 400 \(\upmu\)s, 600 \(\upmu\)s, 800 \(\upmu\)s]. The Max-Cut for the ten random graphs (of each size) was found using LocalSolver, a commercially available optimization tool, and compared to the results of the numerical simulations for the proposed implementation. The resulting average Max-Cut probability for 100 simulation runs of each of the ten random graphs is shown in Fig. 4c. As expected, the probability of finding the optimal solutions decreases with shorter simulation time and for larger networks (higher number of cells). However, the proposed implementation is able to find the Max-Cut solutions consistently, especially for longer simulation times. Moreover, the amplitude of the SHIL signal is simply ramped in our simulations to phase binarize the system, but other schedules could greatly improve the probability of finding Max-Cut solutions27. However, the focus of this work is to demonstrate that the behaviour of the proposed system is dominated by (7) and that it is suitable to realize an oscillator-based IM. These simulation results further confirm that our proposal is a viable approach to realize highly reconfigurable oscillator-based IMs.
The implementation explored here is based on hexagonal cells consisting of six oscillators with operating frequencies distributed within \([\omega _{min},\omega _{max}] = 2\pi\) [5 MHz, 10 MHz]. In principle, the number of oscillators in a cell can be increased. However, the feasibility of doing this strongly depends on the practical implementation of the oscillator network. Specifically, the impact of increasing the number of oscillators has two implications for practical realization. First, for a certain frequency range or bandwidth, e.g. between 5 MHz and 10 MHz, the minimum frequency difference \(\omega _{diff,min}\) between two oscillators in the network decreases, which makes the design of the oscillators more challenging. Secondly, the coupling K has to be smaller to satisfy \(K<<\omega _{diff,min}\), which leads to longer convergence times.
Proof-of-Concept Implementation using CMOS Ring Oscillators
To demonstrate that the proposed approach can be implemented using relatively simple circuit elements, a proof-of-concept IM was developed in a 180 nm CMOS process using RC ring oscillators, as presented in Fig. 5. The implementation of a single cell (as it was presented in Fig. 2b) consists of six SHIL ring oscillators with load capacitances \(C_i\) chosen to achieve operating frequencies \(\omega _i\) (\(i = 1,2,\ldots ,6\)) distributed according to a Golomb ruler. The ring oscillators are coupled through a resistor \(R_c\) to a summing amplifier and the tunable coupling element is implemented with a variable voltage controlled resistor \(R_{p}\), as shown in Fig. 5b. The coefficients \(c_{i,j}\) translate into the voltage amplitude of the modulation signal as \(2c_{i,j}/(N(N-1))\) V. The resistance is modulated around zero and consequently requires both positive and negative values. In this proof-of-concept implementation, \(R_p\) is modeled as an ideal voltage controlled resistor that can have both positive and negative values and is controlled by the modulation signal a(t). In a complete circuit implementation, this resistance can be implemented as in45 using a transistor in series with a negative resistance. The second harmonic injection locking in the ring oscillator shown in Fig. 5a is realized with a current source which is injecting a current at twice the fundamental:
The current is ramped up over the simulation time and normalized to the largest capacitance \(C_6\), to achieve a uniform SHIL strength in all ring oscillators53. The advantage of the proposed implementation can be clearly observed since only a single tunable element is needed to set the coupling between any oscillators in the network. The differential equations describing the voltage on the capacitors can be written as:
where \(I_{D1,i-D3,i}\) are the drain currents of the MOS transistors and \(V_{cm}\) is the common-mode voltage of the summing amplifier. The coupling in the network is determined by the last term in (10c) where \(K \propto R_p/(R_cR_f)\). For a full analysis of Eq. (10) and how it can be simplified to (7), the reader is referred to ’Supplementary material’. The phase of each oscillator relative to its SHIL signal was extracted by comparing the waveforms of the voltage \(V_{c1,i}\) with a reference signal \(V_{ref,i} = sin(2\omega _i t)\). To account for different couplings, as a consequence of the varying capacitance \(C_i\), the \(c_{i,j}\) were normalized to achieve a uniform coupling, similarly to what was done for the \(I_{SHIL}\) in (9). Each SHIL RC ring oscillator was implemented with 13-stages (Fig. 5a shows only 3 stages for simplicity), \(R_L = 5.75\) k\(\Omega\) and a capacitance in the range from \(C_1 = 482.5\) fF to \(C_6 = 725\) fF resulting in \(\omega _1 = 2\pi \cdot 10.75\) MHz and \(\omega _6 = 2\pi \cdot 16.08\) MHz. The main motivation behind increasing the number of stages in the RC ring oscillators to 13 was to reduce the coupling in the network (which is proportional to the number of stages53) to satisfy \(K<< \omega _{diff,min}\) and lower the operating frequency to tens of MHz. Moreover, the resistances \(R_c = 25\) k\(\Omega\) and \(R_f = 4\) k\(\Omega\) were also chosen to achieve a weak coupling in the network. Finally, the amplitude of the tunable resistance and the SHIL current are chosen as \(R_p = 2 \mathrm{k} \Omega /\mathrm{V}\) and \(I_{inj} = 10 \upmu\) A. To verify the functionality of the proposed implementation, transient simulations were performed and the phase difference was extracted. Figure 6a presents the phase difference between the oscillators and the reference signal \(V_{ref,i}\) for an all-to-all connected graph of six oscillators settling to the Max-Cut solution. Figure 6b presents the average Max-Cut probability for 10 runs of ten randomly generated graphs for simulation times \(t_{end}\) = [50 \(\upmu\)s, 100 \(\upmu\)s, 150 \(\upmu\)s, 200 \(\upmu\)s]. These simulation results confirm that the proposed implementation shown in Fig. 5 operates as an oscillator-based IM and consistently finds the Max-Cut solution.
To further verify that the proposed implementation can be scaled as shown in Fig. 4a, simulations of three coupled hexagonal cells were performed. It is important to note that the amplitude of oscillation needs to be kept relatively uniform throughout the network for a uniform coupling. Since oscillators on the boundary have different operating conditions (as a consequence of being only connected to one or two cells), these ring oscillators were appropriately designed to achieve a uniform oscillation amplitude. The simulation results, presented in Fig. 6c, demonstrate that the three hexagonal cells have also a typical oscillator-based IM behaviour.
Discussion
A major challenge with realizing large scale IMs is the number of highly reconfigurable coupling elements that are needed. Consequently, the possibility of implementing a simple and tunable coupling on-chip could be one of the determining factors of what technology is best suited for realizing large scale IMs. On the algorithm site, various schemes to transform the Ising Hamiltonian from an all-to-all connected problem to a locally connected problem, such as minor embedding and LHZ, have been proposed51,52. However, these methods usually come with disadvantages such as computational overhead and performance degradation. On the hardware site, approaches to simplify the immensely complex hardware needed for IMs, such as time-division multiplexing14, computing in memory18 or using ferroelectric transistors to realize reconfigurable couplings54, have been explored. Oscillator-based IMs open the possibility to realize reconfigurability using different frequencies, similar to frequency division multiplexing in communication systems.
In this paper, we have proposed an oscillator-based IM, with high reconfigurability through quasiperiodic modulation of the coupling strength. Oscillators operating at distinct frequencies are mutually coupled through a common medium and connections are purely determined by the harmonic content of an externally applied modulation signal. Therefore, the proposed scheme could greatly simplify the implementation of highly reconfigurable oscillator-based IMs. The complexity is largely moved outside the oscillator network, specifically to the generation of the modulation signals. While a similar approach has previously been explored for Josephson parametric oscillator IMs47, this is the first work exploring oscillator-based IMs based on these principles, in CMOS technology. Moreover, although the implementation in47 shares many similarities with the approach proposed here, there is an important difference between the two approaches. Specifically, in47 the operating frequencies are distributed evenly with a unit difference. For this reason, mapping a problem to the architecture requires an additional computational step to correctly map a problem to the architecture (as is discussed in detail in47). In the approach proposed here, the need for this additional step is eliminated by a proper choice of the operating frequencies according to a Golomb ruler.
Additionally, to address the limitations of the proposed scheme, we investigated the possibility of using a hexagonal grid for a potentially scalable implementation. However, unless graph-embedding is combined with the hexagonal grid, the architecture is limited to relative sparse graphs. It is important to note that with currently available graph-embedding techniques, the computational overhead has the potential to diminish any advantages of hardware IMs51,52. Consequently, more research is required to evaluate the scalability of the proposed architecture for arbitrary dense graphs. Theoretically, the proposed approach can be combined with conventionally coupled oscillators operating at the same frequency. For example, long range interactions could be realized with conventionally coupled oscillators, while clusters of highly reconfigurable oscillators can be realized with the method proposed here. The oscillator-based IM has been also demonstrated with a proof-of-concept implementation based on CMOS RC ring oscillators. Nevertheless, the proposed approach comes at the cost of longer convergence times for finding the optimal solutions as a consequence of the weak coupling in the network. Quantifying this approach in relation to conventional oscillator-based IMs is challenging without exploring much larger benchmark graphs than presented here, which will be addressed in future work. It is important to mention that in27 a network of coupled LC oscillators has \(K/\omega \approx 0.02\), while the proposed ring oscillator proof-of-concept has \(K/\omega \approx 0.001\). Consequently, the phase dynamics in our proposed implementation takes place on a time scale \(\approx 10x\) slower than the implementation in27.
Finally, the proposed approach is not limited to CMOS oscillators and can be applied theoretically to any oscillator having a sinusoidal coupling. Thus, it can potentially be explored for realizing novel oscillator-based IMs using emerging technologies, such as spintronic oscillator arrays40,55, where achieving highly reconfigurable coupling can be challenging. Moreover, an alternative approach, which it was not discussed in our manuscript, based on modulating the coupling signal of each oscillator separately46,47, could be also explored.
Data availability
The data used and/or analysed during the current study are available from the corresponding author on reasonable request.
References
Benedetti, M., Realpe-Gómez, J., Biswas, R. & Perdomo-Ortiz, A. Quantum-assisted learning of hardware-embedded probabilistic graphical models. Phys. Rev. X 7, 041052. https://doi.org/10.1103/PhysRevX.7.041052 (2017).
Li, R. Y., Di Felice, R., Rohs, R. & Lidar, D. A. Quantum annealing versus classical machine learning applied to a simplified computational biology problem. NPJ Quant. Inf. 4, 12. https://doi.org/10.1038/s41534-018-0060-8 (2018).
Hernandez, M. & Aramon, M. Enhancing quantum annealing performance for the molecular similarity problem. Quant. Inf. Process. 16, 56. https://doi.org/10.1007/s11128-017-1586-y (2017).
Babbush, R., Love, P. J. & Aspuru-Guzik, A. Adiabatic quantum simulation of quantum chemistry. Sci. Rep. 4, 6603. https://doi.org/10.1038/srep06603 (2014).
Rieffel, E. G. et al. A case study in programming a quantum annealer for hard operational planning problems. Quant. Inf. Process. 14, 1–36. https://doi.org/10.1007/s11128-014-0892-x (2015).
Lucas, A. Ising formulations of many np problems. Front. Phys. 2, 5. https://doi.org/10.3389/fphy.2014.00005 (2014).
Ray, P., Chakrabarti, B. K. & Chakrabarti, A. Sherrington-kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations. Phys. Rev. B 39, 11828–11832. https://doi.org/10.1103/PhysRevB.39.11828 (1989).
Apolloni, B., Carvalho, M. C. & de Falco, D. Quantum stochastic optimization. Stoch. Process. Appl. 33, 233–244. https://doi.org/10.1016/0304-4149(89)90040-9 (1989).
Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse ising model. Phys. Rev. E 58, 5355–5363. https://doi.org/10.1103/PhysRevE.58.5355 (1998).
McGeoch, C. & Farré, P. Advantage processor overview. https://www.dwavesys.com/learn/resource-library (2022)
Johnson, M. W. et al. Quantum annealing with manufactured spins. Nature 473, 194–198. https://doi.org/10.1038/nature10012 (2011).
Marandi, A., Wang, Z., Takata, K., Byer, R. L. & Yamamoto, Y. Network of time-multiplexed optical parametric oscillators as a coherent Ising machine. Nat. Photonics8, 937–942 https://doi.org/10.1038/nphoton.2014.249 (2014). arXiv:1407.2871.
McMahon, P. et al. A fully programmable 100-spin coherent ising machine with all-to-all connections. Science 354, 614–617. https://doi.org/10.1126/science.aah5178 (2016).
Honjo, T. et al. 100,000-spin coherent ising machine. Sci. Adv. 7, eabh0952. https://doi.org/10.1126/sciadv.abh0952 (2021).
Yamaoka, M. et al. A 20k-spin ising chip to solve combinatorial optimization problems with cmos annealing. IEEE J. Solid-State Circ. 51, 303–309. https://doi.org/10.1109/JSSC.2015.2498601 (2016).
Matsubara, S. et al. Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC) 667–672 https://doi.org/10.1109/ASP-DAC47756.2020.9045100 (2020).
Yamamoto, K. et al. STATICA: A 512-Spin 0.25M-weight full-digital annealing processor with a near-memory all-spin-updates-at-once architecture for combinatorial optimization with complete spin-spin interactions. In Dig. Tech. Pap. IEEE Int. Solid-State Circuits Conf. 2020 138–140 https://doi.org/10.1109/ISSCC19947.2020.9062965 (2020).
Su, Y., Kim, H. & Kim, B. 31.2 cim-spin: A 0.5-to-1.2v scalable annealing processor using digital compute-in-memory spin operators and register-based spins for combinatorial optimization problems. In 2020 IEEE International Solid- State Circuits Conference (ISSCC) 480–482 https://doi.org/10.1109/ISSCC19947.2020.9062938 (2020).
Takemoto, T., Hayashi, M., Yoshimura, C. & Yamaoka, M. A \(2 \times 30\)k-spin multi-chip scalable CMOS annealing processor based on a processing-in-memory approach for solving large-scale combinatorial optimization problems. IEEE J. Solid-State Circ. 55, 145–156. https://doi.org/10.1109/JSSC.2019.2949230 (2020).
Takashi, T., Kasho, Y.C.Y., Hayashi, M., Masafumi, T.H.S. & Mayumi, M.M.Y. A 144Kb annealing system composed of \(9 \times 16\)Kb annealing processor chips with scalable chip-to-chip connections for. 2021 IEEE Int. Solid-State Circ. Conf. (ISSCC)64, 64–65 (2021).
Goto, H. et al. High-performance combinatorial optimization based on classical mechanics. Sci. Adv. 7, 1–10. https://doi.org/10.1126/sciadv.abe7953 (2021).
Tatsumura, K., Yamasaki, M. & Goto, H. Scaling out Ising machines using a multi-chip architecture for simulated bifurcation. Nat. Electron. 4, 208–217. https://doi.org/10.1038/s41928-021-00546-4 (2021).
Parihar, A., Shukla, N., Jerry, M., Datta, S. & Raychowdhury, A. Vertex coloring of graphs via phase dynamics of coupled oscillatory networks. Sci. Rep.7, 1–11 https://doi.org/10.1038/s41598-017-00825-1 (2017). arXiv:1609.02079.
Afoakwa, R., Zhang, Y., Vengalam, U. K. R., Ignjatovic, Z. & Huang, M. BRIM: Bistable resistively-coupled ising machine. Proc. Int. Symp. High-Perform. Comput. Archit. 2021, 749–760 https://doi.org/10.1109/HPCA51647.2021.00068 (2021).
Roychowdhury, J. Bistable Latch Ising Machines, vol. 12984 (LNCS (Springer International Publishing, 2021).
Chang, M., Yin, X., Toroczkai, Z., Hu, X. & Raychowdhury, A. An analog clock-free compute fabric base on continuous-time dynamical system for solving combinatorial optimization problems. IEEE CICC 2022(2022), 4–5 (2022).
Wang, T. & Roychowdhury, J. Oim: Oscillator-based ising machines for solving combinatorial optimisation problems. In Unconventional Computation and Natural Computation 232–256 https://doi.org/10.1007/978-3-030-19311-9_19 (2019).
Chou, J., Bramhavar, S., Ghosh, S. & Herzog, W. Analog coupled oscillator based weighted ising machine. Sci. Rep. 9, 1–10. https://doi.org/10.1038/s41598-019-49699-5 (2019).
Vaidya, J., Surya Kanthi, R. S. & Shukla, N. Creating electronic oscillator-based Ising machines without external injection locking. Sci. Rep. 12, 1–8. https://doi.org/10.1038/s41598-021-04057-2 (2022).
Bashar, M. K. et al. Experimental demonstration of a reconfigurable coupled oscillator platform to solve the max-cut problem. IEEE J. Explor. Solid-State Comput. Dev. Circ. 6, 116–121. https://doi.org/10.1109/JXCDC.2020.3025994 (2020).
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 Circ. 56, 2870–2880. https://doi.org/10.1109/JSSC.2021.3062821 (2021).
Bashar, M. K., Mallick, A. & Shukla, N. Experimental investigation of the dynamics of coupled oscillators as ising machines. IEEE Access 9, 148184–148190. https://doi.org/10.1109/ACCESS.2021.3124808 (2021).
Erementchouk, M., Shukla, A. & Mazumder, P. On computational capabilities of Ising machines based on nonlinear oscillators. Phys. D: Nonlinear Phenom. 437, 133334. https://doi.org/10.1016/j.physd.2022.133334 (2022).
Mallick, A., Bashar, M. K., Lin, Z. & Shukla, N. Computational models based on synchronized oscillators for solving combinatorial optimization problems. Phys. Rev. Appl.17, 1 https://doi.org/10.1103/PhysRevApplied.17.064064 (2022). arXiv:2206.05907.
Shin, J. H., Jeong, Y. J., Zidan, M. A., Wang, Q. & Lu, W. D. hardware acceleration of simulated annealing of spin glass by RRAM crossbar array. Tech. Dig. Int. Electron Devices Meet. IEDM2018, 331–334 https://doi.org/10.1109/IEDM.2018.8614698 (2019).
Cai, F. et al. Power-efficient combinatorial optimization using intrinsic noise in memristor Hopfield neural networks. Nat. Electron. 3, 409–418. https://doi.org/10.1038/s41928-020-0436-6 (2020).
Kaiser, J. & Datta, S. Probabilistic computing with p-bits. Appl. Phys. Lett. 119, 15. https://doi.org/10.1063/5.0067927 (2021).
Aadit, N. A. et al. Massively parallel probabilistic computing with sparse Ising machines. Nat. Electron.5, 460–468 https://doi.org/10.1038/s41928-022-00774-2 (2022). arXiv:2110.02481.
Albertsson, D. I. et al. Ultrafast ising machines using spin torque nano-oscillators. Appl. Phys. Lett. 118, 112404. https://doi.org/10.1063/5.0041575 (2021).
Houshang, A. et al. Phase-binarized spin hall nano-oscillator arrays: Towards spin hall ising machines. Phys. Rev. Appl. 17, 014003. https://doi.org/10.1103/PhysRevApplied.17.014003 (2022).
McGoldrick, B. C., Sun, J. Z. & Liu, L. Ising machine based on electrically coupled spin hall nano-oscillators. Phys. Rev. Appl.10, 1 https://doi.org/10.1103/physrevapplied.17.014006 (2021). arXiv:2110.08885.
Dutta, S., Khanna, A. & Datta, S. Understanding the continuous-time dynamics of phase-transition nano-oscillator-based Ising Hamiltonian solver. IEEE J. Explor. Solid-State Comput. Dev. Circ. 6, 155–163. https://doi.org/10.1109/JXCDC.2020.3045074 (2020).
Dutta, S. et al. An ising hamiltonian solver based on coupled stochastic phase-transition nano-oscillators. Nat. Electron. 4, 502–512. https://doi.org/10.1038/s41928-021-00616-7 (2021).
Hoppensteadt, F. C. & Izhikevich, E. M. Oscillatory neurocomputers with dynamic connectivity. Phys. Rev. Lett. 82, 2983–2986. https://doi.org/10.1103/PhysRevLett.82.2983 (1999).
Hölzel, R. W. & Krischer, K. Pattern recognition with simple oscillating circuits. New J. Phys. 13, 073031. https://doi.org/10.1088/1367-2630/13/7/073031 (2011).
Kostorz, K., Hölzel, R. W. & Krischer, K. Distributed coupling complexity in a weakly coupled oscillatory network with associative properties. New J. Phys. 15, 083010. https://doi.org/10.1088/1367-2630/15/8/083010 (2013).
Onodera, T., Ng, E. & McMahon, P. L. A quantum annealer with fully programmable all-to-all coupling via Floquet engineering. npj Quant. Inf.6, 1–10 https://doi.org/10.1038/s41534-020-0279-z (2020). arXiv:1907.05483.
Kuramoto, Y. Chemical Oscillations, Waves, and Turbulence, vol. 19 of Springer Series in Synergetics (Springer, 1984).
Shinomoto, S. & Kuramoto, Y. Phase transitions in active rotator systems. Prog. Theor. Phys.75, 1105–1110 https://doi.org/10.1143/PTP.75.1105 (1986). https://academic.oup.com/ptp/article-pdf/75/5/1105/5232662/75-5-1105.pdf.
Childs, L. M. & Strogatz, S. H. Stability diagram for the forced kuramoto model. Chaos Interdiscip. J. Nonlinear Sci. 18, 043128. https://doi.org/10.1063/1.3049136 (2008).
Konz, M. S., Lechner, W., Katzgraber, H. G. & Troyer, M. Embedding overhead scaling of optimization problems in quantum annealing. PRX Quant. 2, 040322. https://doi.org/10.1103/PRXQuantum.2.040322 (2021).
Hamerly, R. et al. Experimental investigation of performance differences between coherent Ising machines and a quantum annealer. Sci. Adv.5, 1–11 https://doi.org/10.1126/sciadv.aau0823 (2019). arXiv:1805.05217.
Hazeri, A. R. & Miar-Naimi, H. Generalized analytical equations for injected ring oscillator with rc-load. IEEE Trans. Circ. Syst. I: Regul. Pap. 65, 223–234. https://doi.org/10.1109/TCSI.2017.2726100 (2017).
Mallick, A. et al. Cmos-compatible ising machines built using bistable latches coupled through ferroelectric transistor arrays. Sci. Rep. 13(1), 1515. https://doi.org/10.48550/ARXIV.2205.14729 (2022).
Zahedinejad, M. et al. Two-dimensional mutually synchronized spin Hall nano-oscillator arrays for neuromorphic computing. Nat. Nanotechnol. 15, 47–52. https://doi.org/10.1038/s41565-019-0593-9 (2020).
Acknowledgements
This work was supported by the Swedish Research Council (VR) under 2016-05980 and 2022-02990 projects.
Funding
Open access funding provided by Royal Institute of Technology.
Author information
Authors and Affiliations
Contributions
D.I.A. performed simulations and analysis. A.R. provided valuable input and supervision throughout the project. D.I.A. and A.R. both contributed to the manuscript writing.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Albertsson, D.I., Rusu, A. Highly reconfigurable oscillator-based Ising Machine through quasiperiodic modulation of coupling strength. Sci Rep 13, 4005 (2023). https://doi.org/10.1038/s41598-023-31155-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-023-31155-0
- Springer Nature Limited