A single shot coherent Ising machine based on a network of injection-locked multicore fiber lasers.

Combinatorial optimization problems over large and complex systems have many applications in social networks, image processing, artificial intelligence, computational biology and a variety of other areas. Finding the optimized solution for such problems in general are usually in non-deterministic polynomial time (NP)-hard complexity class. Some NP-hard problems can be easily mapped to minimizing an Ising energy function. Here, we present an analog all-optical implementation of a coherent Ising machine (CIM) based on a network of injection-locked multicore fiber (MCF) lasers. The Zeeman terms and the mutual couplings appearing in the Ising Hamiltonians are implemented using spatial light modulators (SLMs). As a proof-of-principle, we demonstrate the use of optics to solve several Ising Hamiltonians for up to thirteen nodes. Overall, the average accuracy of the CIM to find the ground state energy was ~90% for 120 trials. The fundamental bottlenecks for the scalability and programmability of the presented CIM are discussed as well.

Nonlinear optical components for all-optical probabilistic graphical model.

The probabilistic graphical models (PGMs) are tools that are used to compute probability distributions over large and complex interacting variables. They have applications in social networks, speech recognition, artificial intelligence, machine learning, and many more areas. Here, we present an all-optical implementation of a PGM through the sum-product message passing algorithm (SPMPA) governed by a wavelength multiplexing architecture. As a proof-of-concept, we demonstrate the use of optics to solve a two node graphical model governed by SPMPA and successfully map the message passing algorithm onto photonics operations. The essential mathematical functions required for this algorithm, including multiplication and division, are implemented using nonlinear optics in thin film materials. The multiplication and division are demonstrated through a logarithm-summation-exponentiation operation and a pump-probe saturation process, respectively. The fundamental bottlenecks for the scalability of the presented scheme are discussed as well.