A poor man's coherent Ising machine based on opto-electronic feedback systems for solving optimization problems

Training an Ising machine with equilibrium propagation

Ising machines, which are hardware implementations of the Ising model of coupled spins, have been influential in the development of unsupervised learning algorithms at the origins of Artificial Intelligence (AI). However, their application to AI has been limited due to the complexities in matching supervised training methods with Ising machine physics, even though these methods are essential for achieving high accuracy. In this study, we demonstrate an efficient approach to train Ising machines in a supervised way through the Equilibrium Propagation algorithm, achieving comparable results to software-based implementations. We employ the quantum annealing procedure of the D-Wave Ising machine to train a fully-connected neural network on the MNIST dataset. Furthermore, we demonstrate that the machine's connectivity supports convolution operations, enabling the training of a compact convolutional network with minimal spins per neuron. Our findings establish Ising machines as a promising trainable hardware platform for AI, with the potential to enhance machine learning applications.

Robust QRS detection based on simulated degenerate optical parametric oscillator-assisted neural network

Accurately detecting the depolarization QRS complex in the ventricles is a fundamental requirement for cardiovascular disease detection using electrocardiography (ECG). In contrast to traditional signal enhancement algorithms, emerging neural network approaches have shown promise for QRS detection because of their generalizability on complex data. However, the inevitable noise present during ECG recording leads to a decrease in the performance of neural networks. To enhance the robustness and performance of neural network-based QRS detectors, we propose a simulated degeneration unit (SDU)-assisted convolutional neural network (CNN). An SDU simulates the physical degeneration process of interfering optical pulses, which can effectively suppress in-band noise. Through comprehensive performance evaluations on three open-source databases, the SDU-enhanced CNN-based approach demonstrated better performance in detecting QRS complexes than other recently reported QRS detectors. Furthermore, real-world noise injection tests indicate that the optimal noise robustness boundary for the CNN equipped with SDU is 167-300% higher than that for the CNN without SDU.

Parametric Frequency Divider Based Ising Machines

We report on a new class of Ising machines (IMs) that rely on coupled parametric frequency dividers (PFDs) as macroscopic artificial spins. Unlike the IM counterparts based on subharmonic-injection locking (SHIL), PFD IMs do not require strong injected continuous-wave signals or applied dc voltages. Therefore, they show a significantly lower power consumption per spin compared to SHIL-based IMs, making it feasible to accurately solve large-scale combinatorial optimization problems that are hard or even impossible to solve by using the current von Neumann computing architectures. Furthermore, using high quality factor resonators in the PFD design makes PFD IMs able to exhibit a nanowatt-level power per spin. Also, it remarkably allows a speedup of the phase synchronization among the PFDs, resulting in shorter time to solution and lower energy to solution despite the resonators' longer relaxation time. As a proof of concept, a 4-node PFD IM has been demonstrated. This IM correctly solves a set of Max-Cut problems while consuming just 600 nanowatts per spin. This power consumption is 2 orders of magnitude lower than the power per spin of state-of-the-art SHIL-based IMs operating at the same frequency.

Ferroelectric compute-in-memory annealer for combinatorial optimization problems

Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the memory access issue, scalability, restricted applicability to certain types of COPs, and VLSI-incompatibility, respectively. Here we report a ferroelectric field effect transistor (FeFET) based compute-in-memory (CiM) annealer for solving larger-scale COPs efficiently. Our CiM annealer converts COPs into quadratic unconstrained binary optimization (QUBO) formulations, and uniquely accelerates in-situ the core vector-matrix-vector (VMV) multiplication operations of QUBO formulations in a single step. Specifically, the three-terminal FeFET structure allows for lossless compression of the stored QUBO matrix, achieving a remarkably 75% chip size saving when solving Max-Cut problems. A multi-epoch simulated annealing (MESA) algorithm is proposed for efficient annealing, achieving up to 27% better solution and ~ 2X speedup than conventional simulated annealing. Experimental validation is performed using the first integrated FeFET chip on 28nm HKMG CMOS technology, indicating great promise of FeFET CiM array in solving general COPs.

Point convolutional neural network algorithm for Ising model ground state research based on spring vibration

The ground state search of the Ising model can be used to solve many combinatorial optimization problems. Under the current computer architecture, an Ising ground state search algorithm suitable for hardware computing is necessary for solving practical problems. Inspired by the potential energy conversion of the springs, we propose the Spring-Ising Algorithm, a point convolutional neural network algorithm for ground state search based on the spring vibration model. Spring-Ising Algorithm regards the spin as a moving mass point connected to a spring and establishes the equation of motion for all spins. Spring-Ising Algorithm can be mapped on AI chips through the basic structure of the neural network for fast and efficient parallel computing. The algorithm has shown promising results in solving the Ising model and has been tested in the recognized test benchmark K2000. The optimal results of this algorithm after 10,000 steps of iteration are 2.9% of all results. The algorithm introduces the concept of dynamic equilibrium to achieve a more detailed local search by dynamically adjusting the weight of the Ising model in the spring oscillation model. Spring-Ising Algorithm offers the possibility to calculate the Ising model on a chip which focuses on accelerating neural network calculations.

Hyperscaling in the Coherent Hyperspin Machine

Classical and quantum systems are used to simulate the Ising Hamiltonian, an essential component in large-scale optimization and machine learning. However, as the system size increases, devices like quantum annealers and coherent Ising machines face an exponential drop in their success rate. Here, we introduce a novel approach involving high-dimensional embeddings of the Ising Hamiltonian and a technique called "dimensional annealing" to counteract the decrease in performance. This approach leads to an exponential improvement in the success rate and other performance metrics, slowing down the decline in performance as the system size grows. A thorough examination of convergence dynamics in high-performance computing validates the new methodology. Additionally, we suggest practical implementations using technologies like coherent Ising machines, all-optical systems, and hybrid digital systems. The proposed hyperscaling heuristics can also be applied to other quantum or classical Ising devices by adjusting parameters such as nonlinear gain, loss, and nonlocal couplings.

Wavelength-division multiplexing optical Ising simulator enabling fully programmable spin couplings and external magnetic fields

Recently various physical systems have been proposed for modeling Ising spin Hamiltonians appealing to solve combinatorial optimization problems with remarkable performance. However, how to implement arbitrary spin-spin interactions is a critical and challenging problem in unconventional Ising machines. Here, we propose a general gauge transformation scheme to enable arbitrary spin-spin interactions and external magnetic fields as well, by decomposing an Ising Hamiltonian into multiple Mattis-type interactions. With this scheme, a wavelength-division multiplexing spatial photonic Ising machine (SPIM) is developed to show the programmable capability of general spin coupling interactions. We exploit the wavelength-division multiplexing SPIM to simulate three spin systems: ±J models, Sherrington-Kirkpatrick models, and only locally connected J1-J2 models and observe the phase transitions. We also demonstrate the ground-state search for solving Max-Cut problem with the wavelength-division multiplexing SPIM. These results promise the realization of ultrafast-speed and high-power efficiency Boltzmann sampling to a generalized large-scale Ising model.

Editorial for the Special Issue on Magnetic and Spin Devices, Volume II

Although the miniaturization of metal-oxide-semiconductor field effect transistors (MOSFETs)-the main driver behind an outstanding increase in the speed, performance, density, and complexity of modern integrated circuits-is continuing, numerous outstanding technological challenges in complimentary metal-oxide-semiconductor (CMOS) device miniaturization are slowly bringing the downscaling to saturation [...].

Designing Ising machines with higher order spin interactions and their application in solving combinatorial optimization

The Ising model provides a natural mapping for many computationally hard combinatorial optimization problems (COPs). Consequently, dynamical system-inspired computing models and hardware platforms that minimize the Ising Hamiltonian, have recently been proposed as a potential candidate for solving COPs, with the promise of significant performance benefit. However, prior work on designing dynamical systems as Ising machines has primarily considered quadratic interactions among the nodes. Dynamical systems and models considering higher order interactions among the Ising spins remain largely unexplored, particularly for applications in computing. Therefore, in this work, we propose Ising spin-based dynamical systems that consider higher order (> 2) interactions among the Ising spins, which subsequently, enables us to develop computational models to directly solve many COPs that entail such higher order interactions (i.e., COPs on hypergraphs). Specifically, we demonstrate our approach by developing dynamical systems to compute the solution for the Boolean NAE-K-SAT (K ≥ 4) problem as well as solve the Max-K-Cut of a hypergraph. Our work advances the potential of the physics-inspired 'toolbox' for solving COPs.

Bifurcation behaviors shape how continuous physical dynamics solves discrete Ising optimization

Simulating physical dynamics to solve hard combinatorial optimization has proven effective for medium- to large-scale problems. The dynamics of such systems is continuous, with no guarantee of finding optimal solutions of the original discrete problem. We investigate the open question of when simulated physical solvers solve discrete optimizations correctly, with a focus on coherent Ising machines (CIMs). Having established the existence of an exact mapping between CIM dynamics and discrete Ising optimization, we report two fundamentally distinct bifurcation behaviors of the Ising dynamics at the first bifurcation point: either all nodal states simultaneously deviate from zero (synchronized bifurcation) or undergo a cascade of such deviations (retarded bifurcation). For synchronized bifurcation, we prove that when the nodal states are uniformly bounded away from the origin, they contain sufficient information for exactly solving the Ising problem. When the exact mapping conditions are violated, subsequent bifurcations become necessary and often cause slow convergence. Inspired by those findings, we devise a trapping-and-correction (TAC) technique to accelerate dynamics-based Ising solvers, including CIMs and simulated bifurcation. TAC takes advantage of early bifurcated "trapped nodes" which maintain their sign throughout the Ising dynamics to reduce computation time effectively. Using problem instances from open benchmark and random Ising models, we validate the superior convergence and accuracy of TAC.

Optoelectronic coherent Ising machine for combinatorial optimization problems

Hopfield networks are iterative procedures able to solve combinatorial optimization problems. New studies regarding algorithm-architecture adequacy are fostered by the re-emergence of hardware implementations of such methods in the form of Ising machines. In this work, we propose an optoelectronic architecture suitable for fast processing and low energy consumption. We show that our approach allows effective optimization relevant to statistical image denoising.

Low Power Coherent Ising Machine Based on Mechanical Kerr Nonlinearity

Finding a reliable Ising machine for solving nondeterministic polynomial-class problems has attracted great attention in recent years, where an authentic system can be expanded with polynomial-scaled resources to find the ground state Ising Hamiltonian. In this Letter, we propose an extremely low power optomechanical coherent Ising machine based on a new enhanced symmetry breaking mechanism and highly nonlinear mechanical Kerr effect. The mechanical movement of an optomechanical actuator induced by the optical gradient force greatly increases the nonlinearity by a few orders and significantly reduces the power threshold using conventional structures capable of fabrication via photonic integrated circuit platforms. With the simple but strong bifurcation mechanism and remarkably low power requirement, our optomechanical spin model opens a path for chip-scale integration of large-size Ising machine implementations with great stability.

Optimization with photonic wave-based annealers

Many NP-hard combinatorial optimization (CO) problems can be cast as a quadratic unconstrained binary optimization model, which maps naturally to an Ising model. The final spin configuration in the Ising model can adiabatically arrive at a solution to a Hamiltonian, given a known set of interactions between spins. We enhance two photonic Ising machines (PIMs) and compare their performance against classical (Gurobi) and quantum (D-Wave) solvers. The temporal multiplexed coherent Ising machine (TMCIM) uses the bistable response of an electro-optic modulator to mimic the spin up and down states. We compare TMCIM performance on Max-cut problems. A spatial photonic Ising machine (SPIM) convolves the wavefront of a coherent laser beam with the pixel distribution of a spatial light modulator to adiabatically achieve a minimum energy configuration, and solve a number partitioning problem (NPP). Our computational results on Max-cut indicate that classical solvers are still a better choice, while our NPP results show that SPIM is better as the problem size increases. In both cases, connectivity in Ising hardware is crucial for performance. Our results also highlight the importance of better understanding which CO problems are most likely to benefit from which type of PIM. This article is part of the theme issue 'Quantum annealing and computation: challenges and perspectives'.

E-Spin: A Stochastic Ising Spin Based on Electrically-Controlled MTJ for Constructing Large-Scale Ising Annealing Systems

With its unique computer paradigm, the Ising annealing machine has become an emerging research direction. The Ising annealing system is highly effective at addressing combinatorial optimization (CO) problems that are difficult for conventional computers to tackle. However, Ising spins, which comprise the Ising system, are difficult to implement in high-performance physical circuits. We propose a novel type of Ising spin based on an electrically-controlled magnetic tunnel junction (MTJ). Electrical operation imparts true randomness, great stability, precise control, compact size, and easy integration to the MTJ-based spin. In addition, simulations demonstrate that the frequency of electrically-controlled stochastic Ising spin (E-spin) is 50 times that of the thermal disturbance MTJ-based spin (p-bit). To develop a large-scale Ising annealing system, up to 64 E-spins are implemented. Our Ising annealing system demonstrates factorization of integers up to 264 with a temporal complexity of around O(n). The proposed E-spin shows superiority in constructing large-scale Ising annealing systems and solving CO problems.

Multidimensional hyperspin machine

From condensed matter to quantum chromodynamics, multidimensional spins are a fundamental paradigm, with a pivotal role in combinatorial optimization and machine learning. Machines formed by coupled parametric oscillators can simulate spin models, but only for Ising or low-dimensional spins. Currently, machines implementing arbitrary dimensions remain a challenge. Here, we introduce and validate a hyperspin machine to simulate multidimensional continuous spin models. We realize high-dimensional spins by pumping groups of parametric oscillators, and show that the hyperspin machine finds to a very good approximation the ground state of complex graphs. The hyperspin machine can interpolate between different dimensions by tuning the coupling topology, a strategy that we call "dimensional annealing". When interpolating between the XY and the Ising model, the dimensional annealing substantially increases the success probability compared to conventional Ising simulators. Hyperspin machines are a new computational model for combinatorial optimization. They can be realized by off-the-shelf hardware for ultrafast, large-scale applications in classical and quantum computing, condensed-matter physics, and fundamental studies.

Large-scale coherent Ising machine based on optoelectronic parametric oscillator

Ising machines based on analog systems have the potential to accelerate the solution of ubiquitous combinatorial optimization problems. Although some artificial spins to support large-scale Ising machines have been reported, e.g., superconducting qubits in quantum annealers and short optical pulses in coherent Ising machines, the spin stability is fragile due to the ultra-low equivalent temperature or optical phase sensitivity. In this paper, we propose to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement a large-scale Ising machine with high stability. The proposed machine supports 25,600 spins and can operate continuously and stably for hours. Moreover, the proposed Ising machine is highly compatible with high-speed electronic devices for programmability, paving a low-cost, accurate, and easy-to-implement way toward solving real-world optimization problems.

Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning

Ising machines are a promising non-von-Neumann computational concept for neural network training and combinatorial optimization. However, while various neural networks can be implemented with Ising machines, their inability to perform fast statistical sampling makes them inefficient for training neural networks compared to digital computers. Here, we introduce a universal concept to achieve ultrafast statistical sampling with analog Ising machines by injecting noise. With an opto-electronic Ising machine, we experimentally demonstrate that this can be used for accurate sampling of Boltzmann distributions and for unsupervised training of neural networks, with equal accuracy as software-based training. Through simulations, we find that Ising machines can perform statistical sampling orders-of-magnitudes faster than software-based methods. This enables the use of Ising machines beyond combinatorial optimization and makes them into efficient tools for machine learning and other applications.

A tree search algorithm towards solving Ising formulated combinatorial optimization problems

Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily recast as the ground state search problem of the Ising Hamiltonian. However, for practical implementation, the annealing process cannot be arbitrarily slow and hence, it may deviate from the expected stationary Boltzmann distribution and become trapped in a local energy minimum. To overcome this problem, this paper proposes a heuristic search algorithm by expanding search space from a Markov chain to a recursive depth limited tree based on SA, where the parent and child nodes represent the current and future spin states. At each iteration, the algorithm selects the best near-optimal solution within the feasible search space by exploring along the tree in the sense of “look ahead”. Furthermore, motivated by the coherent Ising machine (CIM), the discrete representation of spin states is relaxed to a continuous representation with a regularization term, which enables the use of the reduced dynamics of the oscillators to explore the surrounding neighborhood of the selected tree nodes. We tested our algorithm on a representative NP-hard problem (MAX-CUT) to illustrate the effectiveness of the proposed algorithm compared to semi-definite programming (SDP), SA, and simulated CIM. Our results show that with the primal heuristics SA and CIM, our high-level tree search strategy is able to provide solutions within fewer epochs for Ising formulated combinatorial optimization problems.

Neural Schrödinger Equation: Physical Law as Deep Neural Network

We show a new family of neural networks based on the Schrödinger equation (SE-NET). In this analogy, the trainable weights of the neural networks correspond to the physical quantities of the Schrödinger equation. These physical quantities can be trained using the complex-valued adjoint method. Since the propagation of the SE-NET can be described by the evolution of physical systems, its outputs can be computed by using a physical solver. The trained network is transferable to actual optical systems. As a demonstration, we implemented the SE-NET with the Crank-Nicolson finite difference method on Pytorch. From the results of numerical simulations, we found that the performance of the SE-NET becomes better when the SE-NET becomes wider and deeper. However, the training of the SE-NET was unstable due to gradient explosions when SE-NET becomes deeper. Therefore, we also introduced phase-only training, which only updates the phase of the potential field (refractive index) in the Schrödinger equation. This enables stable training even for the deep SE-NET model because the unitarity of the system is kept under the training. In addition, the SE-NET enables a joint optimization of physical structures and digital neural networks. As a demonstration, we performed a numerical demonstration of end-to-end machine learning (ML) with an optical frontend toward a compact spectrometer. Our results extend the application field of ML to hybrid physical-digital optimizations.

Global minimization via classical tunneling assisted by collective force field formation

Simple elements interacting in networks can give rise to intricate emergent behaviors. Examples such as synchronization and phase transitions often apply in many contexts, as many different systems may reduce to the same effective model. Here, we demonstrate such a behavior in a model inspired by memristors. When weakly driven, the system is described by movement in an effective potential, but when strongly driven, instabilities cause escapes from local minima, which can be interpreted as an unstable tunneling mechanism. We dub this collective and nonperturbative effect a “Lyapunov force,” which steers the system toward the global minimum of the potential function, even if the full system has a constellation of equilibrium points growing exponentially with the system size. This mechanism is appealing for its physical relevance in nanoscale physics and for its possible applications in optimization, Monte Carlo schemes, and machine learning.

100,000-spin coherent Ising machine

Computers based on physical systems are increasingly anticipated to overcome the impending limitations on digital computer performance. One such computer is a coherent Ising machine (CIM) for solving combinatorial optimization problems. Here, we report a CIM with 100,512 degenerate optical parametric oscillator pulses working as the Ising spins. We show that the CIM delivers fine solutions to maximum cut problems of 100,000-node graphs drastically faster than standard simulated annealing. Moreover, the CIM, when operated near the phase transition point, provides some extremely good solutions and a very broad distribution. This characteristic will be useful for applications that require fast random sampling such as machine learning.

Experimental Observation of Phase Transitions in Spatial Photonic Ising Machine

Statistical spin dynamics plays a key role in understanding the working principle for novel optical Ising machines. Here, we propose the gauge transformation for a spatial photonic Ising machine, where a single spatial phase modulator simultaneously encodes spin configurations and programs interaction strengths. Using gauge transformation, we experimentally evaluate the phase diagram of a high-dimensional spin-glass equilibrium system with 100 fully connected spins. We observe the presence of paramagnetic, ferromagnetic, and spin-glass phases and determine the critical temperature T_{c} and the critical probability p_{c} of the phase transitions, which agree well with the mean-field theory predictions. Thus, the approximation of the mean-field model is experimentally verified in the spatial photonic Ising machine. Furthermore, we discuss the phase transition in parallel with solving combinatorial optimization problems during the cooling process and identify that the spatial photonic Ising machine is robust with sufficient many-spin interactions even when the system is associated with optical aberrations and measurement uncertainty.

Accuracy-enhanced coherent Ising machine using the quantum adiabatic theorem

The coherent Ising machine (CIM) implemented by degenerate optical parametric oscillator (DOPO) networks is a novel optical platform to accelerate computation of hard combinatorial optimization problems. Nevertheless, with the increase of the problem size, the probability of the machine being trapped by local minima increases exponentially. According to the quantum adiabatic theorem, a physical system will remain in its instantaneous ground state if the time-dependent Hamiltonian varies slowly enough. Here, we propose a method to help the machine partially avoid getting stuck in local minima by introducing quantum adiabatic evolution to the ground-state-search process of the CIM, which we call A-CIM. Numerical simulation results demonstrate that A-CIM can obtain improved solution accuracy in solving MAXCUT problems of vertices ranging from 10 to 2000 than CIM. The proposed machine that is based on quantum adiabatic theorem is expected to solve optimization problems more correctly.

Theory of Neuromorphic Computing by Waves: Machine Learning by Rogue Waves, Dispersive Shocks, and Solitons

We study artificial neural networks with nonlinear waves as a computing reservoir. We discuss universality and the conditions to learn a dataset in terms of output channels and nonlinearity. A feed-forward three-layered model, with an encoding input layer, a wave layer, and a decoding readout, behaves as a conventional neural network in approximating mathematical functions, real-world datasets, and universal Boolean gates. The rank of the transmission matrix has a fundamental role in assessing the learning abilities of the wave. For a given set of training points, a threshold nonlinearity for universal interpolation exists. When considering the nonlinear Schrödinger equation, the use of highly nonlinear regimes implies that solitons, rogue, and shock waves do have a leading role in training and computing. Our results may enable the realization of novel machine learning devices by using diverse physical systems, as nonlinear optics, hydrodynamics, polaritonics, and Bose-Einstein condensates. The application of these concepts to photonics opens the way to a large class of accelerators and new computational paradigms. In complex wave systems, as multimodal fibers, integrated optical circuits, random, topological devices, and metasurfaces, nonlinear waves can be employed to perform computation and solve complex combinatorial optimization.

Demonstration of chip-based coupled degenerate optical parametric oscillators for realizing a nanophotonic spin-glass

The need for solving optimization problems is prevalent in various physical applications, including neuroscience, network design, biological systems, socio-economics, and chemical reactions. Many of these are classified as non-deterministic polynomial-time hard and thus become intractable to solve as the system scales to a large number of elements. Recent research advances in photonics have sparked interest in using a network of coupled degenerate optical parametric oscillators (DOPOs) to effectively find the ground state of the Ising Hamiltonian, which can be used to solve other combinatorial optimization problems through polynomial-time mapping. Here, using the nanophotonic silicon-nitride platform, we demonstrate a spatial-multiplexed DOPO system using continuous-wave pumping. We experimentally demonstrate the generation and coupling of two microresonator-based DOPOs on a single chip. Through a reconfigurable phase link, we achieve both in-phase and out-of-phase operation, which can be deterministically achieved at a fast regeneration speed of 400 kHz with a large phase tolerance.

Observation of binary phase states of time-multiplexed degenerate optical parametric oscillator pulses generated using a nonlinear fiber Sagnac loop

We generated time-multiplexed degenerate optical parametric oscillator (DOPO) pulses using a nonlinear fiber Sagnac loop as a phase-sensitive amplifier (PSA), where the pump and amplified light in pump-signal-idler degenerate four-wave mixing can be spatially separated. By placing the PSA in a fiber cavity, we successfully generated more than 5000 time-multiplexed DOPO pulses. We confirmed the bifurcation of pulse phases to 0 or π relative to the pump phase, which makes them useful for representing Ising spins in an Ising model solver based on coherent optical oscillator networks. We also confirmed inherent randomness of the DOPO phases using the National Institute of Standards and Technology random number test.

Optoelectronic parametric oscillator

Oscillators are one of the key elements in various applications as a signal source to generate periodic oscillations. Among them, an optical parametric oscillator (OPO) is a driven harmonic oscillator based on parametric frequency conversion in an optical cavity, which has been widely investigated as a coherent light source with an extremely wide wavelength tuning range. However, steady oscillation in an OPO is confined by the cavity delay, which leads to difficulty in frequency tuning, and the frequency tuning is discrete with the minimum tuning step determined by the cavity delay. Here, we propose and demonstrate a counterpart of an OPO in the optoelectronic domain, i.e., an optoelectronic parametric oscillator (OEPO) based on parametric frequency conversion in an optoelectronic cavity to generate microwave signals. Owing to the unique energy-transition process in the optoelectronic cavity, the phase evolution in the OEPO is not linear, leading to steady single-mode oscillation or multimode oscillation that is not bounded by the cavity delay. Furthermore, the multimode oscillation in the OEPO is stable and easy to realize owing to the phase control of the parametric frequency-conversion process in the optoelectronic cavity, while stable multimode oscillation is difficult to achieve in conventional oscillators such as an optoelectronic oscillator (OEO) or an OPO due to the mode-hopping and mode-competition effect. The proposed OEPO has great potential in applications such as microwave signal generation, oscillator-based computation, and radio-frequency phase-stable transfer.

Machine learning based on reservoir computing with time-delayed optoelectronic and photonic systems

The concept of reservoir computing emerged from a specific machine learning paradigm characterized by a three-layered architecture (input, reservoir, and output), where only the output layer is trained and optimized for a particular task. In recent years, this approach has been successfully implemented using various hardware platforms based on optoelectronic and photonic systems with time-delayed feedback. In this review, we provide a survey of the latest advances in this field, with some perspectives related to the relationship between reservoir computing, nonlinear dynamics, and network theory.